问一道面试题# JobHunting - 待字闺中
b*w
1 楼
Three coke machines. Each one has two values min & max, which means if
you get coke from this machine it will load you a random volume in the range
[min, max]. Given a cup size n and minimum soda volume m, show if it's
possible to make it from these machines.
除了brute force还有什么好方法, 现在想到的是memorization, 把不成的都记下来
。
you get coke from this machine it will load you a random volume in the range
[min, max]. Given a cup size n and minimum soda volume m, show if it's
possible to make it from these machines.
除了brute force还有什么好方法, 现在想到的是memorization, 把不成的都记下来
。