今天在LeetCode OJ上刷算法,以前没有怎么看算法题。然后对着一道Medium的题目,想了整个下午,好不容易才解出来。贴了代码,分享一下自己奋斗一下午的成果,有不足的,请大家指出来哈!微笑
题目:
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, return 2because 13 = 4 + 9.
- #include <stdio.h>
#include <stdlib.h>
/* 记Array(i)为数字i的最小完全平方数个数
* Array(0) = 0;
* Array(1) = Array(1-1^2)+1;
* Array(2) = A