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"].
确定有序数组的区间
需要注意各种边界细节,每次确定区间之后需要清空。
public class Solution { public List<String> summaryRanges(int[] nums) { List<String> list = new ArrayList<String>(); if(nums.length == 0) return list; if(nums.length == 1) { list.add(nums[0]+""); return list; } boolean flag = false; StringBuilder ele = new StringBuilder(); for(int i=0; i<nums.length; i++) { int start = 0, end = 0; if(!flag) { start = nums[i]; flag = true; ele.append(start+""); } if(i<nums.length-1 && nums[i] != nums[i+1]-1) { end = nums[i]; flag = false; if(nums[i] != start) { ele.append("->" + end); } } if(ele != null) { if(i == nums.length-2 && nums[i] == nums[i+1]-1) { end = nums[i+1]; ele.append("->" + end); list.add(ele.toString()); ele.delete(0, ele.length()); break; } if(!flag || flag&&i==nums.length-1) { list.add(ele.toString()); ele.delete(0, ele.length()); } } } return list; } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112835275-168981902.gif)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112841431-2047172832.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112847494-1544911856.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112904385-918783221.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111120143119-1302805212.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112856369-1466718103.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112830416-794416355.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111113919510-1155220901.gif)