leetcode之Summary Ranges
来源:互联网 发布:流量劫持 sql注入 编辑:程序博客网 时间:2024/05/16 17:45
题目:
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.
解答:
直接进行线性遍历即可,注意判断起始和结束是否相等
class Solution {public: vector<string> summaryRanges(vector<int>& nums) { vector<string> res; for(int i = 0; i < nums.size(); i++){ int s = nums[i], e = nums[i]; while(i < nums.size() - 1 && nums[i] + 1== nums[i+1]) i++; e = nums[i]; if(s != e) res.push_back(to_string(s) + "->" + to_string(e)); else res.push_back(to_string(s)); } return res; }};
0 0
- LeetCode之Summary Ranges
- leetcode之Summary Ranges
- LeetCode 之 Summary Ranges
- LeetCode OJ 之 Summary Ranges
- Leetcode之Summary Ranges 问题
- 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
- 如何解决C/C++中stack overflow问题
- MR-5.MapReduce排序
- java火车站售票系统之多线程并发访问
- Qt之进程间通信(Windows消息)
- MR-5.MapReduce常见Joins方法
- leetcode之Summary Ranges
- C++拷贝构造函数详解
- unix环境高级编程之信号篇(一)
- 用CMD命令快速安全的导入备份的SQL大文件
- 【ZYNQ-7000开发之十】TGP+VDMA+HDMI搭建视频通路
- SwipeRefreshLayout配合RecyclerView实现下拉刷新和上拉加载更多以及没有数据的显示
- openfire服务器无法开启问题解决
- hdu 1561 The more, The Better(树形DP)
- 欢迎使用CSDN-markdown编辑器