leetcode/0228: summaryRanges.java at main · jmartinez159/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
55
56
57
58
59
//problem : https://leetcode.com/problems/summary-ranges/submissions/938568984/

class Solution {
    public List<String> summaryRanges(int[] nums) {

        List<String> sol = new ArrayList<String>();
        if(nums.length == 0){

            return sol;
        }
        int i = 1;
        boolean flag = false;
        String ans = "" + nums[0];
        System.out.println(nums[0]);
        while(i < nums.length){

            if(nums[i-1]+1 != nums[i]){


                if(flag){

                    System.out.println(nums[i-1]);

                    sol.add(new String(ans + "->" + nums[i-1]));
                    flag = false;
                }
                else{

                    sol.add(ans);
                }

                System.out.println(nums[i]);
                ans = new String(nums[i] + "");
            }
            else{

                flag = true;
            }

            i++;
        }

        if(flag){


            sol.add(new String(ans + "->" + nums[nums.length-1]));

        }

        else{

            sol.add(nums[nums.length-1] + "");
        }


        return sol;
    }
}