开始刷leetcode day71:Summary Ranges
来源:互联网 发布:js权威指南第七版pdf 编辑:程序博客网 时间:2024/06/06 01:26
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.
Java:
public class Solution {
public List<String> summaryRanges(int[] nums) {
List<String> result = new ArrayList<String>();
if(nums.length ==0) return result;
int record = nums[0];
int front = nums[0];
boolean haslink = false;
for(int i=1; i< nums.length; i++)
{
if(nums[i] != front + 1)
{
if(haslink)
{
result.add(record + "->" + front);
}else
{
result.add(front+"");
}
haslink = false;
front = nums[i];
record = front;
}else
{
haslink = true;
front = nums[i];
}
}
if(haslink) result.add(record + "->" + front);
else result.add(front+"");
return result;
}
}
- 开始刷leetcode day71:Summary Ranges
- 开始刷leetcode day71: Power of Two
- 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
- Generate Parentheses
- Html Table 合并单元格
- poj2387解题报告(Dijkstra算法)
- pat 1046. Shortest Distance (20)
- HDU 1011 Starship Troopers (树形DP+背包)
- 开始刷leetcode day71:Summary Ranges
- Oracle database wrc执行报错ORA-15557
- 连接Oracle、登录Linux速度缓慢
- poj 2253 Frogger (spfa) (Floyd)
- java中collection 和collections的区别
- JavaScript中的Array对象方法调用
- 华为OJ题目 -- 初级篇(机试OJ平台)
- 进程的同步与互斥
- css中em与px的区别