python C++ Greedy速解找零問題Leetcode 860 Lemonade Change
b=20時貪婪演算法保持檢查順序,先找十塊,五塊留著,不要改變檢查順序,否則出錯
-----
When b=20, the greedy algorithm maintains the checking order. Give back $10 first, keep $5 as possible and do not change the checking order, otherwise it will not work.
[codes on Leetcode]https://leetcode.com/problems/lemonad...
[Leetcode程式] • Python C++計數排序與一行解Leetcode 1051 Height Ch...
[C++, python貪婪演算解多邊形問題Leetcode 2971 Find Polygon With the Largest Perimeter] • C++, python貪婪演算解多邊形問題Leetcode 2971 Find P...