solution/2100-2199/2139.Minimum Moves to Reach Target Score/Solution.go at main

main

leetcode-ion

388 issues
2 pull requests
5,000 files
1 active branch

List view

solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.go

0 Duplication
1 Churn
12 Lines
12 Lines of Code

func minMoves(target int, maxDoubles int) int {
	if target == 1 {
		return 0
	}
	if maxDoubles == 0 {
		return target - 1
	}
	if target%2 == 0 && maxDoubles > 0 {
		return 1 + minMoves(target>>1, maxDoubles-1)
	}
	return 1 + minMoves(target-1, maxDoubles)
}