leetcode/SummaryRanges.java at master · aalexcomas11/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
import java.util.*;
//solution needs to be refactored
class SummaryRanges {
    public static void main(String[] args) {

        int[][] test = {
            {0,1,2},
            {0,1,2,4},
            {2,7,9},
            {0,1,2,4,5,7},
            {0,2,3,4,6,8,9}
        };

        for(int[] t : test){
            summaryRanges(t);
        }

    }
        static public List<String> summaryRanges(int[] nums) {

            int i = 0;
            ArrayList<String> ans = new ArrayList<>();

            while(i < nums.length){
                for(int j = i+1; j < nums.length; j++){
                    if(j + 1 == nums.length){
                        if(j - i > 1){
                            if(nums[j] == nums[i] + j){
                                ans.add(nums[i]+"->"+nums[j]);
                            }
                            else{
                                ans.add(nums[i]+"->"+nums[j-1]);
                                ans.add(nums[j]+"");
                            }
                        }
                        else{
                            ans.add(nums[j]+"");
                        }
                    }
                   else if(nums[j] != nums[i] + j){
                    if(j - i > 1){
                        ans.add(nums[i]+"->"+nums[j-1]);
                        i = j;
                    }
                    else{
                        ans.add(nums[j-1]+"");
                        i = j;
                    }
                   }
                }
            }
            return ans;
        }
}