Yu's Coding Garden : leetcode Question: Summary Ranges

Yu's Coding Garden : leetcode Question: Summary Ranges

Pages Summary Ranges Given a sorted integer array without duplicates, return the summary of its ranges. For example, given  Analysis: This is an easy question. Since the ranges are all continuous integers, we just need scan the whole array, compare each element with its previous one, if they are not continuous numbers, the current number must belong a new range. In my code, the start and end of the current range is kept in each iteration, don't forget the case that only one number can become a range and the output format is slight different required in this question. Code(C++): class Solution { public: vector summaryRanges(vector& nums) { vector res; if (nums.size()==0){ return res; } int st = nums[0]; int ed = nums[0]; for (int i=1;i" + to_string(ed) ); } st = nums[i]; ed = nums[i]; }else{ ed = nums[i]; } } if (st == ed){ res.

Read full article from Yu's Coding Garden : leetcode Question: Summary Ranges