[Leetcode] Summary Ranges
来源:互联网 发布:淘宝买家账号出错 编辑:程序博客网 时间:2024/06/05 18:30
描述
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"]
.
分析
遍历一遍数组,每次记录起始位置以及最远能够合并的位置,同时还需判断能合并的是一个数还是一个序列。
代码
class Solution {public: vector<string> summaryRanges(vector<int>& nums) { vector<string> res; int i = 0; while (i <nums.size()) { int j = 0; while (i + j < nums.size() && nums[i + j] - nums[i] == j) j++; res.push_back(j == 1 ? to_string(nums[i]) : to_string(nums[i]) + "->" + to_string(nums[i + j - 1])); i += j; } return res; }};
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
- 努力学习C++
- Spring插件安装
- 华为OJ-字符串加密
- (二)剑指Offer之替换空格
- 优美数式
- [Leetcode] Summary Ranges
- linux alias 参数问题
- java记录
- caffe的python接口学习(4):mnist实例---手写数字识别
- INT4和INT8
- 简单搭建注解ssh项目(一)
- 安装Android Studio遇到的那些坑及解决办法
- 字符串问题。
- 要把时间浪费在美好的事情上