Leetcode Summary Ranges

原创 2015年07月10日 15:02: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"].

从第一个元素开始,找到连续的子序列,保存在string类型的变量里。

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> result;
        string temp = "";
        char number[10];
        bool flag = false;
        for(int i=0,j=0; i<nums.size(); i++)
        {
            sprintf(number,"%d",nums[i]);
            temp = temp + number;
            while((nums[i+1]-nums[i] == 1)&&(i+1<nums.size()))
            {
                flag = true;
                i++;
            }
            if(flag)
            {
                sprintf(number,"%d",nums[i]);
                temp = temp + "->" + number;
            }
            flag = false;
            result.push_back(temp);
            temp = "";
        }
     return result;   
    }
};


Leetcode_228_Summary Ranges

本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/46762039 Given a sorted in...

leetcode--Summary Ranges

题目: Given a sorted integer array without duplicates, return the summary of its ranges. For example...

【LeetCode OJ 228】Summary Ranges

题目链接:https://leetcode.com/problems/summary-ranges/ 题目: Given a sorted integer array without dupl...

Leetcode——228. Summary Ranges

题目Given a sorted integer array without duplicates, return the summary of its ranges.For example, giv...

LeetCode228——Summary Ranges

leetcode刷题日记——Summary Ranges 1.题目内容: Given a sorted integer array without duplicates, return the su...

228. Summary Ranges

Given a sorted integer array without duplicates, return the summary of its ranges. For example, giv...
  • iFuMI
  • iFuMI
  • 2016年03月22日 17:13
  • 223

Summary Ranges 问题解答

前段时间刷了几道leetcode上面的题,觉得比较有意思,但由于没有记录,所以过一段时间就忘记了。计划在这里对每刷的一道题都进行总结,本次的题如下:题目 Given a sorted integer...

Summary Ranges

1 题目描述 Given a sorted integer array without duplicates, return the summary of its ranges. For exa...

228. Summary Ranges\59. Spiral Matrix II\64. Minimum Path Sum

Summary Ranges 题目描述 代码实现 Spiral Matrix II 题目描述 代码实现 Minimum Path Sum 题目描述 代码实现228. Summary Ranges题目描...

Leetcode 163. Missing Ranges

163. Missing Ranges Total Accepted: 18160 Total Submissions: 60189 Difficulty: Medium Cont...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Leetcode Summary Ranges
举报原因:
原因补充:

(最多只允许输入30个字)