Kevin Blog

This question on LeetCode is a typical DP problem. Unfortunately, I always have a hard time solving DP problems. Therefore, practicing with this coin-change question would be the best way for me to become more familiar with DP.

This question on LeetCode has been bothering me for a couple of days and afterwards I understood that the typical solution is to use BFS for the cases specified in the description of the question. Therefore, I take a note to let me memorize the solution to this problem next time.

前言

歷經好幾個月的風雨，最近終於靜下心來看完這本 Clean Coder 無暇的程式碼，與過去看的技術工具書不同，這本比較偏向在職場工程師需謹記的態度和原則，從 Bob 大叔長年的親身經歷和過去踩過的雷，相信可以從他的經驗中學習，同時面對如瘋子般的 User，能夠保持專業的行為。