add solution task #56

Author: dmitryburov

README.md

@@ -265,6 +265,7 @@
   - [X] [1. Two Sum](sprint_leetcode/1)
   - [X] [19. Remove Nth Node From End of List](sprint_leetcode/19)
   - [X] [33. Search in Rotated Sorted Array](sprint_leetcode/33)
+  - [X] [56. Merge Intervals](sprint_leetcode/56)
   - [X] [155. Min Stack](sprint_leetcode/155)
   - [X] [328. Odd Even Linked List](sprint_leetcode/328)
   - [X] [347. Top K Frequent Elements](sprint_leetcode/347)

sprint_leetcode/56/README.md

@@ -0,0 +1,3 @@
+# 56. Merge Intervals
+
+Подробнее о задаче: [Тыц](https://leetcode.com/problems/merge-intervals/)

sprint_leetcode/56/solution.go

@@ -0,0 +1,27 @@
+package main
+
+import (
+	"sort"
+)
+
+func merge(intervals [][]int) [][]int {
+	sort.Slice(intervals, func(i, j int) bool {
+		return intervals[i][0] < intervals[j][0]
+	})
+
+	result := make([][]int, 0)
+
+	for _, interval := range intervals {
+		if len(result) == 0 || result[len(result)-1][1] < interval[0] {
+			result = append(result, interval)
+		} else {
+			max := result[len(result)-1][1]
+			if result[len(result)-1][1] < interval[1] {
+				max = interval[1]
+			}
+			result[len(result)-1][1] = max
+		}
+	}
+
+	return result
+}

sprint_leetcode/56/solution_test.go

@@ -0,0 +1,39 @@
+package main
+
+import (
+	"fmt"
+	"reflect"
+	"testing"
+)
+
+type TestItemInput struct {
+	nums [][]int
+}
+type TestItem struct {
+	input  TestItemInput
+	output [][]int
+}
+
+func TestTask(t *testing.T) {
+	for i, v := range generateTasks() {
+		t.Run(fmt.Sprintf("Test %d", i+1), func(t *testing.T) {
+			res := merge(v.input.nums)
+			if !reflect.DeepEqual(res, v.output) {
+				t.Errorf("Wrong test.\nOutput: \n%v \nExpected: \n%v", res, v.output)
+			}
+		})
+	}
+}
+
+func generateTasks() []TestItem {
+	return []TestItem{
+		{
+			input:  TestItemInput{nums: [][]int{{1, 3}, {2, 6}, {8, 10}, {15, 18}}},
+			output: [][]int{{1, 6}, {8, 10}, {15, 18}},
+		},
+		{
+			input:  TestItemInput{nums: [][]int{{1, 4}, {4, 5}}},
+			output: [][]int{{1, 5}},
+		},
+	}
+}