leetcode 228: Summary Ranges

2015-11-21 00:58:51 · 作者: · 浏览: 6

?

Summary Ranges

Total Accepted: 511 Total Submissions: 2271

?

Given a sorted integer array without duplicates, return the summary of its ranges.

For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].

[思路]

两个指针 start, end. 如果nums[end+1] = nums[end]+1, 就移动end指针, 否则, 插入字符串nums[start]->nums[end].

[CODE]

?

public class Solution {
    // [0,1,2,4,5,7], return ["0->2","4->5","7"]. 
    public List
  
    summaryRanges(int[] nums) {
        List
   
     res = new ArrayList<>(); if(nums==null || nums.length<1) return res; int s=0, e=0; while(e
    
   
  


?

?

?