66 finish

Author: aQua

Algorithms/0066.plus-one/README.md

@@ -9,7 +9,7 @@ The digits are stored such that the most significant digit is at the head of the
 
 ## 解题思路
 
-
+见程序注释
 ## 总结
 
 

Algorithms/0066.plus-one/plus-one.go

@@ -6,8 +6,10 @@ func plusOne(digits []int) []int {
 		return []int{1}
 	}
 
+	// 末尾加一
 	digits[length-1]++
 
+	// 处理进位
 	for i := length - 1; i > 0; i-- {
 		if digits[i] < 10 {
 			break
@@ -16,6 +18,7 @@ func plusOne(digits []int) []int {
 		digits[i-1]++
 	}
 
+	// 处理首位的进位
 	if digits[0] > 9 {
 		digits[0] -= 10
 		digits = append([]int{1}, digits...)