"github.com/stretchr/testify/assert"

	"github.com/matryer/is"

	is := is.NewRelaxed(t)

			assert.Equal(t, tc.expected, tictactoe.Minimax(0, 0, true, tc.scores, int(height)))

			is.Equal(tc.expected, tictactoe.Minimax(0, 0, true, tc.scores, int(height)))

	github.com/stretchr/testify v1.6.1

	github.com/matryer/is v1.4.0

	"github.com/stretchr/testify/assert"

	"github.com/matryer/is"

	is := is.NewRelaxed(t)

			assert.Equal(t, tc.expected, tc.board.Evaluate())

			is.Equal(tc.expected, tc.board.Evaluate())

package ngn_test
import (
	"ngn"
	"testing"
	"github.com/matryer/is"
)
func TestGrowing(t *testing.T) {
	var cases = []struct {
		input    string
		expected string
	}{
		{"19", "22"},
		{"99", "111"},
		{"2533", "2555"},
		{"123456879", "123456888"},
		{"11123159995399999", "11123333333333333"},
		{"123456788", "123456789"},
		{"1234999", "1235555"},
	}
	for _, tc := range cases {
		is := is.New(t)
		t.Run("Growing"+tc.input, func(t *testing.T) {
			is.Equal(tc.expected, ngn.Growing(tc.input, ngn.Tipping(tc.input)))
		})
	}
}

package ngn
import (
	"strconv"
)
func Tipping(n string) (tipping int) {
	for i := 0; i < len(n)-1; i++ {
		if n[i] > n[i+1] {
			return i
		}
	}
	return tipping
}
func Growing(n string, tipping int) (ret string) {
	//log.Printf("num: %s, tipping: %d", n, tipping)
	if tipping != 0 {
		return tipgrow(n, tipping)
	}
	// there is no tipping poing, input is already a growing number
	for i := len(n) - 1; i >= 0; i-- {
		curr := n[i]
		//log.Printf("curr: %c\t%v, i: %d\n", curr, curr, i)
		if curr != 57 && i == len(n)-1 {
			// its not 9 and it is the last so we do not have to bump the place value
			curr++
			ret = n[:len(n)-1] + string(curr)
			return ret
		}
		if curr == 57 && i == 0 {
			// it is all 9, eg: 99
			// we have to prepend 1 to it
			n = strconv.Itoa(1) + n
			return tipgrow(n, 0)
		}
		if curr != 57 {
			curr++
			//log.Printf("pre: %s, curr: %s, post: %s", n[:i], string(curr), n[i+1:])
			n = n[:i] + string(curr) + n[i+1:]
			return tipgrow(n, i)
		}
	}
	return ret
}
func tipgrow(n string, tipping int) (ret string) {
	for i := 0; i < len(n); i++ {
		if i < tipping {
			ret += string(n[i])
		} else {
			new := n[tipping]
			ret += string(new)
		}
	}
	return ret
}