Leetcode 279 Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =
原创
2015-09-10 23:05:15 ·
728 阅读 ·
0 评论