summary_ranges

hitzzc · hitzzc · commit 103e10792c96 · 2016-10-17T23:39:14.000+08:00
diff --git a/README.md b/README.md
@@ -184,6 +184,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [225. Implement Stack using Queues](https://github.com/hitzzc/go-leetcode/tree/master/implement_stack_using_queues)
 #### [226. Invert Binary Tree](https://github.com/hitzzc/go-leetcode/tree/master/invert_binary_tree)
 #### [227. Basic Calculator II](https://github.com/hitzzc/go-leetcode/tree/master/basic_calculator_II)
+#### [228. Summary Ranges](https://github.com/hitzzc/go-leetcode/tree/master/summary_ranges)
 
 
 
diff --git a/summary_ranges/summary_ranges.go b/summary_ranges/summary_ranges.go
@@ -0,0 +1,36 @@
+package summary_ranges
+
+import (
+	"strconv"
+)
+
+func summaryRanges(nums []int) []string {
+	var ret []string
+	if len(nums) == 0 {
+		return ret
+	}
+	if len(nums) == 1 {
+		return []string{strconv.Itoa(nums[0])}
+	}
+	var i int
+	var j int = 1
+	for ; j < len(nums); j++ {
+		if nums[j] == nums[j-1]+1 {
+			continue
+		}
+		if nums[j] != nums[j-1]+1 {
+			if j-1 == i {
+				ret = append(ret, strconv.Itoa(nums[i]))
+			} else {
+				ret = append(ret, strconv.Itoa(nums[i])+"->"+strconv.Itoa(nums[j-1]))
+			}
+			i = j
+		}
+	}
+	if j-1 == i {
+		ret = append(ret, strconv.Itoa(nums[i]))
+	} else {
+		ret = append(ret, strconv.Itoa(nums[i])+"->"+strconv.Itoa(nums[j-1]))
+	}
+	return ret
+}
