LeetCode題解(2), 動態規劃(Dynamic Programming) 279. Perfect Squares
今天發現了一題還不錯的動態規劃題,難度適中,不用太tricky思維,邏輯稍微清晰一點就可以想得到,題目位於LeetCode的第279題。內容如下:
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...
) which sum to n.