Day 64 a leet code problem - summary_ranges

Author: mandliya

README.md

@@ -6,9 +6,9 @@
 
 | Current Status|     Stats     |
 | :------------: | :----------: |
-| Total Problems | 92 |
-| Current Streak | 63 days |
-| Longest Streak | 63 ( August 17, 2015 - October 18, 2015 ) |
+| Total Problems | 93 |
+| Current Streak | 64 days |
+| Longest Streak | 64 ( August 17, 2015 - October 19, 2015 ) |
 
 </center>
 
@@ -164,3 +164,9 @@ Include contains single header implementation of data structures and some algori
 | :------------ | :----------: |
 | Given two integer arrays, A and B, each containing N integers. You are free to permute the order of the elements in the arrays. Is there an permutation A', B' possible of A and B, such that, A'<sub>i</sub>+B'<sub>i</sub> ≥ K for all i, where A'<sub>i</sub> denotes the i<sup>th</sup> element in the array A' and B'<sub>i</sub> denotes i<sup>th</sup> element in the array B'.| [two_arrays.cpp](greedy_problems/two_arrays.cpp)|
 |John is taking orders. The i<sup>th</sup> order is placed by the i<sup>th</sup> customer at t<sub>i</sub> time and it takes d<sub>i</sub> time to procees. What is the order in which the customers will get their orders? (see more details in solutions's comments)|[orders_order.cpp](greedy_problems/orders_order.cpp)|
+
+###Leet code Problems
+| Problem | Solution |
+| :------------ | :----------: |
+| 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"].| [summary_ranges.cpp](leet_code_problems/summary_ranges.cpp)|
+ 

leet_code_problems/summary_ranges.cpp

@@ -0,0 +1,58 @@
+/*
+ * Leet code problem - summary pages
+ * 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"].
+ */
+
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <string>
+
+std::vector<std::string> summaryRanges(std::vector<int>& nums) {
+        std::vector<std::string> ranges;
+        if (nums.empty()) {
+            return ranges;
+        }
+        std::string curr = std::to_string(nums[0]);
+        int range_start = nums[0];
+
+        for( size_t i = 1; i < nums.size(); ++i ) {
+            if (nums[i-1] + 1 == nums[i]) {
+                continue;
+            } else {
+                if ( range_start != nums[i-1]) {
+                    curr += "->";
+                    curr += std::to_string(nums[i-1]);
+                    ranges.push_back(curr);
+                } else {
+                    ranges.push_back(curr);
+                }
+                curr = std::to_string(nums[i]);
+                range_start = nums[i];
+            }
+        }
+        if (range_start != nums[nums.size() - 1]) {
+            curr += "->";
+            curr += std::to_string(nums[nums.size() - 1]);
+        }
+        ranges.push_back(curr);
+        return ranges;
+}
+
+void printVec( std::vector<std::string> ranges ) {
+	for ( size_t i = 0; i < ranges.size(); ++i ) {
+		if ( i != ranges.size() - 1 ) {
+			std::cout << ranges[i] << ", ";
+		} else {
+			std::cout << ranges[i] << std::endl;
+		}
+	}
+}
+
+int main() {
+	std::vector<int> nums{0,1,2,4,5,7};
+	std::vector<std::string> ranges = summaryRanges(nums);
+	printVec(ranges);
+	return 0;
+}