leetcode279: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 = 13, re
原创
2017-03-28 22:38:03 ·
277 阅读 ·
0 评论