Missing Ranges

本文主要是介绍Missing Ranges，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

我们就用种最朴素的解法就好，bug free，考虑不同的Corner case

public class Solution {public List<String> findMissingRanges(int[] nums, int lower, int upper) {List<String> result = new LinkedList<>();if (nums.length == 0) {if (lower != upper) {result.add(Integer.toString(lower) + "->" + upper);} else {result.add(Integer.toString(lower));}return result;}if (lower < nums[0]) {if (lower == nums[0] - 1) {result.add(Integer.toString(lower));} else {result.add(Integer.toString(lower) + "->" + Integer.toString(nums[0] - 1));}}for (int i = 0; i < nums.length - 1; i++) {if (nums[i + 1] - nums[i] == 2) {result.add(Integer.toString(nums[i] + 1));} else if (nums[i + 1] - nums[i] > 2) {result.add(Integer.toString(nums[i] + 1) + "->" + Integer.toString(nums[i + 1] - 1));}}if (upper > nums[nums.length - 1]) {if (upper == nums[nums.length - 1] + 1) {result.add(Integer.toString(upper));} else {result.add(Integer.toString(nums[nums.length - 1] + 1) + "->" + Integer.toString(upper));}}return result;}
}

这篇关于Missing Ranges的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---