plus_one_test.go

/*
Problem:
- Given a number represented as an array of digits, plus one to the number.

Assumption:
- The input are non-negative.
- The digits are stored such that the most significant digit is at the head of the list.
- The number does not contain leading zeros.

Example:
- Input: []int{1, 2, 5}
  Output: []int{1, 2, 6}
- Input: []int{1, 2, 9}
  Output: []int{1, 3, 0}
- Input: []int{1, 9, 9}
  Output: []int{2, 0, 0}

Solution:
- Iterate through the list from right to left and add 1 to the current digit accordingly.
  - If the current digit is less than 9, add 1 and update it.
  - Otherwise, set it to 0.
- If all the digits are 9, append an 0 in the end and update the first digit to 1.

Cost:
- O(n) time, O(1) space, where n is the length of the list.
*/

package leetcode

import (
	"testing"

	"github.com/hoanhan101/algo/common"
)

func TestPlusOne(t *testing.T) {
	tests := []struct {
		in       []int
		expected []int
	}{
		{[]int{}, []int{}},
		{[]int{0}, []int{1}},
		{[]int{1}, []int{2}},
		{[]int{9}, []int{1, 0}},
		{[]int{1, 2, 5}, []int{1, 2, 6}},
		{[]int{1, 2, 9}, []int{1, 3, 0}},
		{[]int{1, 9, 9}, []int{2, 0, 0}},
		{[]int{9, 9, 9}, []int{1, 0, 0, 0}},
	}

	for _, tt := range tests {
		result := plusOne(tt.in)
		common.Equal(t, tt.expected, result)
	}
}

func plusOne(digits []int) []int {
	// check edge case to see if the input is empty.
	if len(digits) == 0 {
		return digits
	}

	// counter counts the number of 9 appears in the original input.
	counter := 0

	// iterate from right to left and add 1 to the current digit accordingly.
	for i := len(digits) - 1; i > -1; i-- {
		d := digits[i]

		if d < 9 {
			digits[i] = d + 1
			break
		} else {
			digits[i] = 0
			counter++
		}
	}

	// if all digits are 9, add an 0 in the end and change the digit to 1.
	if counter == len(digits) {
		digits = append(digits, 0)
		digits[0] = 1
	}

	return digits
}