228. Summary Ranges
来源:互联网 发布:intent传递int数据 编辑:程序博客网 时间:2024/05/21 06:23
边界条件边界条件边界条件边界条件
class Solution {public: string int_to_str(int n) { if(n==-2147483648) return "-2147483648"; string s; if(n<0) { n=-n; s.push_back('-'); } if(n<10) s.push_back('0'+n); else{ int len=log(n+0.01)/log(10); for(int j=pow(10,len);j>=1;j/=10) { int j0=n/j%10; s.push_back('0'+j0); } } return s; } string int_to_str(int n,int m) { string s; if(n==-2147483648) { s+="-2147483648"; } else { if(n<0) { n=-n; s.push_back('-'); } if(n<10) s.push_back('0'+n); else{ int len=log(n+0.01)/log(10); for(int j=pow(10,len);j>=1;j/=10) { int j0=n/j%10; s.push_back('0'+j0); } } } s.push_back('-'); s.push_back('>'); n=m; if(n<0) { n=-n; s.push_back('-'); } if(n<10) s.push_back('0'+n); else{ int len=log(n+0.01)/log(10); for(int j=pow(10,len);j>=1;j/=10) { int j0=n/j%10; s.push_back('0'+j0); } } return s; } vector<string> summaryRanges(vector<int>& nums) { vector<string> vs; if(!nums.size()) return vs; int l0=nums[0]; for(int i=1;i<nums.size();i++) { if((float)nums[i]-nums[i-1]>1) { if(l0==nums[i-1]) { string s=int_to_str(l0); vs.push_back(s); } else { string s=int_to_str(l0,nums[i-1]); vs.push_back(s); } l0=nums[i]; } } string s; if(l0==nums[nums.size()-1]) { string s=int_to_str(l0); vs.push_back(s); } else { string s=int_to_str(l0,nums[nums.size()-1]); vs.push_back(s); } return vs; }};
0 0
- 228.Summary Ranges
- [leetcode]228.Summary Ranges
- [LeetCode]228.Summary Ranges
- [leetcode] 228.Summary Ranges
- [leetcode] 228. Summary Ranges
- 228. Summary Ranges
- 228. Summary Ranges LeetCode
- 228. Summary Ranges
- 228. Summary Ranges
- 228. Summary Ranges
- 228. Summary Ranges
- 228. Summary Ranges
- 228. Summary Ranges
- leetcode 228. Summary Ranges
- LeetCode *** 228. Summary Ranges
- 228. Summary Ranges
- 228. Summary Ranges
- leetcode-228. Summary Ranges
- Andrroid 面试问题问答
- could improve 125. Valid Palindrome
- Okhttp的简单介绍和使用(一)
- ALGO-124数字三角形 动态规划
- poj 2142 The Balance(扩展欧几里德算法)
- 228. Summary Ranges
- 629A.Far Relative’s Birthday Cake
- C++ 按指定分隔符拆分字符串
- 56-题目1087:约数的个数
- [C]LeetCode:Maximum Depth of Binary Tree
- 慕课网Zepto.js课程学习笔记
- 常用网络管理操作
- Java网络编程——InetAddress
- 寻找 tableview 中的最后一行|自动滚动到最后一行