make the problem a little more general

  • 0

    If the condition n - 1 changes to k, where 1 <= k <= n - 1, there may not be a solution for one input, how to prove whether an input has a solution? If it does have one, how to derive it?

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.