摘要: Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. 1. DP Set an array, first 阅读全文
posted @ 2018-09-29 00:41 elsie12 阅读(161) 评论(0) 推荐(0)