279. Perfect Squares(dp)
摘要：
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. Example 1: Input: n = 12 O 阅读全文
posted @ 2020-11-21 22:18 wsw_seu 阅读(96) 评论(0) 推荐(0) 编辑
