LeetCode-Summary Ranges

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"].

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Solution:

public class Solution {
    public String getRangeStr(int start, int end){
        if (start == end){
                    return Integer.toString(start);
            } else {
                StringBuilder builder = new StringBuilder();
                builder.append(start);
                builder.append("->");
                builder.append(end);
                return builder.toString();
            }
    }
    public List<String> summaryRanges(int[] nums) {
        List<String> resList = new LinkedList<String>();
        if (nums.length==0) return resList;
        
        int start = nums[0];
        int end = nums[0];
        
        for (int i=1;i<nums.length;i++){
            if (nums[i] <= end) continue;
            
            if (nums[i]==end+1){
                end = nums[i];
            } else {
                resList.add(getRangeStr(start,end));
                start = nums[i];
                end = nums[i];
            }
        }
        
        resList.add(getRangeStr(start,end));
        return resList;
    }
}