✨ Added solution to 66

Sathish Babu · Sathish Babu · commit ed50c8befa25 · 2020-06-04T15:50:21.000+05:30
diff --git a/src/0066.Plus-One/Solution.go b/src/0066.Plus-One/Solution.go
@@ -19,3 +19,20 @@ func plusOne(digits []int) []int {
 	}
 	return digits
 }
+
+func Solution(digits []int) []int {
+	n := len(digits)
+	if n < 1 {
+		return []int{1}
+	}
+	digits[n-1] += 1
+	carry := 0
+	for i := n - 1; i >= 0; i-- {
+		n := digits[i] + carry
+		digits[i], carry = n%10, n/10
+	}
+	if carry > 0 {
+		digits = append([]int{carry}, digits...)
+	}
+	return digits
+}
diff --git a/src/0066.Plus-One/Solution_test.go b/src/0066.Plus-One/Solution_test.go
@@ -2,6 +2,7 @@ package Solution
 
 import (
 	"reflect"
+	"strconv"
 	"testing"
 )
 
@@ -25,3 +26,25 @@ func TestSolution(t *testing.T) {
 		})
 	}
 }
+
+func TestSolution2(t *testing.T) {
+	cases := []struct {
+		name   string
+		input  []int
+		expect []int
+	}{
+		{"TestCase", []int{1, 2, 3}, []int{1, 2, 4}},
+		{"TestCase", []int{9, 9, 9}, []int{1, 0, 0, 0}},
+		{"TestCase", []int{5, 9, 9}, []int{6, 0, 0}},
+		{"TestCase", []int{}, []int{1}},
+	}
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i+1), func(t *testing.T) {
+			got := Solution(c.input)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.input)
+			}
+		})
+	}
+}
