LeetCode Summary Ranges

Description:

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

Solution:

题意略微有点难懂，就是将数组进行分段，每一段内都要是连续的。

处理技巧比较多，for循环不如while循环好用。

import java.util.*;

public class Solution {

	public List<String> summaryRanges(int[] nums) {
		ArrayList<String> list = new ArrayList<String>();
		int n = nums.length;

		if (n == 0)
			return list;

		int start = 0, end = 0;
		while (start < n && end < n) {
			while (end + 1 < n && nums[end] + 1 == nums[end + 1])
				end++;
			if (start == end)
				list.add(nums[start] + "");
			else
				list.add(nums[start] + "->" + nums[end]);

			start = end + 1;
			end = start;
		}

		return list;
	}
}