leetcode

Random Problem

2 files changed, 23 insertions(+), 0 deletions(-)

diff --git a/ Problems/0228.cpp b/ Problems/0228.cpp

@@ -0,0 +1,22 @@

class Solution {

public:

vector<string> summaryRanges(vector<int> &nums) {

if (!nums.size()) return {};

vector<string> res;

int start = 0;

for (int i = 1; i < nums.size(); i++) {

if (nums[i] == nums[i - 1] + 1) continue;

if (i - start > 1)

res.push_back(to_string(nums[start]) + "->" + to_string(nums[i - 1]));

else

res.push_back(to_string(nums[start]));

start = i;

}

if (nums.size() - start > 1)

res.push_back(to_string(nums[start]) + "->" + to_string(nums.back()));

else

res.push_back(to_string(nums[start]));

return res;

}

};

diff --git a/ README.md b/ README.md

@@ -199,6 +199,7 @@ for solving problems. | 0225 | Easy | [Implement Stack using Queues](Problems/0225.cpp) | | 0226 | Easy | [Invert Binary Tree](Problems/0226.cpp) | | 0227 | Medium | [Basic Calculator II](Problems/0227.cpp) |

| 0228 | Easy | [Summary Ranges](Problems/0228.cpp) |

| 0231 | Easy | [Power of Two](Problems/0231.cpp) | | 0232 | Easy | [Implement Queue using Stacks](Problems/0232.cpp) | | 0234 | Easy | [Palindrome Linked List](Problems/0234.cpp) |