2015年9月10日
Leetcode 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... 阅读全文
posted @ 2015-09-10 00:32 卖程序的小歪 阅读(163) 评论(0) 推荐(0) 编辑