Leetcode Problem 1066. Campus Bikes II

1066. Campus Bikes II

Leetcode Solutions

Define a recursive function minimumDistanceSum that takes the current worker index and a bitmask representing the assigned bikes.
If all workers have been assigned bikes (worker index equals the number of workers), return 0.
If the result for the current state has been computed before, return the stored result from the memoization table.
For each bike, if it is available (indicated by the bitmask), calculate the Manhattan distance to the current worker and recursively call minimumDistanceSum for the next worker and the updated bitmask.
Store the minimum distance sum found in the memoization table and return it.
Initialize the memoization table and call minimumDistanceSum starting with worker index 0 and bitmask 0.
Return the result of the initial call to minimumDistanceSum.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen