add solution task #66 Plus One

Author: dmitryburov

README.md

@@ -267,6 +267,7 @@
   - [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] [66. Plus One](sprint_leetcode/66)
   - [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/66/README.md

@@ -0,0 +1,3 @@
+# 15. 3Sum
+
+Подробнее о задаче: [Тыц](https://leetcode.com/problems/3sum/description/)

sprint_leetcode/66/solution.go

@@ -0,0 +1,18 @@
+package main
+
+func plusOne(digits []int) []int {
+	n := len(digits)
+
+	for i := n - 1; i >= 0; i-- {
+		if digits[i] < 9 {
+			digits[i]++
+			return digits
+		}
+
+		digits[i] = 0
+	}
+
+	digits = append([]int{1}, digits...)
+
+	return digits
+}

sprint_leetcode/66/solution_test.go

@@ -0,0 +1,43 @@
+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 := plusOne(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, 2, 3}},
+			output: []int{1, 2, 4},
+		},
+		{
+			input:  TestItemInput{nums: []int{4, 3, 2, 1}},
+			output: []int{4, 3, 2, 2},
+		},
+		{
+			input:  TestItemInput{nums: []int{9}},
+			output: []int{1, 0},
+		},
+	}
+}