neighbor candidates pool issue

  • 0

    Takeaway 100% pool or non-100%pool, eager/lazy
    At first , I wanna a 100% pool, which each element is allowable to be a new neighbor, so we can directly pick up the neighbor one by one. So my focus is how to construct pool, which is complicate here
    This is a eager approach
    Can we have a lazy approach, which mean it is ok to have non-allowable elements, so my focus would be how to avoid these element. Actually with the help of element-destination(partial permutations) we can do that.

Log in to reply

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