leetcode: Summary Ranges
来源:互联网 发布:太原师范学院教务网络 编辑:程序博客网 时间:2024/06/03 23:01
找出数组中的所有区间。由于输入的数组是有序的且无重复元素,那么我们遍历一遍数组即可,时间代价是O(n)的。
用两个数字记录当前区间的起止,通过判断nums[i]和nums[i-1]的关系来判断是否区间连续。
另外用一个bool型first来判断还否需要赋初值
public class Solution { public List<String> summaryRanges(int[] nums) { List<String> rt= new ArrayList<String>(); int st=Integer.MIN_VALUE,ed=Integer.MIN_VALUE; int length = nums.length; boolean first = true; for( int i=0;i<length;i++ ) { if(first == true) { st = nums[i]; ed = nums[i]; first = false; continue; } else if( i<length && nums[i]==nums[i-1]+1 ) { ed = nums[i]; continue; } String temp = ""; if(ed == st ) { temp = temp + ed; } else { temp = st+"->"+ed; } rt.add(temp); st = nums[i]; ed = nums[i]; } if(st != Integer.MIN_VALUE ) { String temp = ""; if(ed == st ) { temp = temp + ed; } else { temp = st+"->"+ed; } rt.add(temp); } return rt; }}
0 0
- leetcode 228: Summary Ranges
- Leetcode 228 Summary Ranges
- leetcode--Summary Ranges
- LeetCode 228: Summary Ranges
- [leetcode] Summary Ranges
- 【Leetcode】Summary Ranges
- Summary Ranges - LeetCode 228
- 【LeetCode】Summary Ranges
- [LeetCode]Summary Ranges
- [leetcode] Summary Ranges
- [leetcode][array] Summary Ranges
- leetcode[228]:Summary Ranges
- [LeetCode] Summary Ranges
- #leetcode#Summary Ranges
- leetcode summary-ranges
- Leetcode|Summary Ranges
- [leetCode] Summary Ranges
- [leetcode]Summary Ranges
- 责任链模式 - 行为模式
- 关于java.security.MessageDigest类
- 解决MyEclipse jdk 8 报错问题
- 文章标题
- 发布高品质软件的系统方法
- leetcode: Summary Ranges
- 2015年ALPC暑期专题练习I (计算几何) A
- Functional MRI (second edition) -- 6. From Neuronal to Hemodynamic Activity
- VOA 2015-07-16
- mongoDB 入门指南、示例
- 数字图像处理的基本原理和常用方法
- JSP实现文件上传,解决上传文件名为乱码问题
- MP3压缩算法
- struts文件上传