【Leetcode】Summary Ranges
来源:互联网 发布:mac 无法更新10.11.6 编辑:程序博客网 时间:2024/06/07 09:39
题目链接:https://leetcode.com/problems/summary-ranges/
题目:
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"].
思路:
直接做就好了,时间复杂度O(n)
算法:
public List<String> summaryRanges(int[] nums) {List<String> result = new ArrayList<String>();if (nums.length == 1) {result.add(nums[0] + "");return result;}// 长度大于1时,因为要判断连续,至少要为2for (int i = 0; i < nums.length; i++) {int start = nums[i], j = i, end = i;for (int tmp = start; j < nums.length && nums[j] == tmp; j++, tmp++);if (j == nums.length) { // 当j到了数组最后元素end = nums[j - 1];} else {// 当不连续end = nums[--j];}i = j;if ((end == start)) {result.add(start + "");} else {result.add(start + "->" + end);}}return result;}
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
- 自定义模拟+数字时钟,整合AnalogDigitalView
- Select2使用实例——很好用的下拉提示选择框!
- 括号套括号的计数
- js浏览器控制台不报错,但不运行下面的js代码
- JavaScript数值类型易忽略的角落
- 【Leetcode】Summary Ranges
- linux下邮件查看命令
- fastjson
- [BZOJ3172][Tjoi2013]单词
- STM32F407的RTC时间
- 【2015-12-06】STM32系统架构学习
- UG工程图模板变量
- 【Java基础提高】深入分析final关键字(一)
- 利用Adaboost和LBP特征进行人脸检测