[LeetCode] 279. Perfect Squares

啦啦啦，四平方和定理是啥，我不懂啊～(￣▽￣～)(～￣▽￣)～

	class Solution {
	public int numSquares(int n) {
	int[] dp = new int[n + 1]; //dp[i] - the least number of perfect square number of i
	for (int i = 1; i <= n; i++) {
	dp[i] = Integer.MAX_VALUE;
	}
	for (int i = 0; i <= n; i++) {
	for (int j = 1; i + j * j <= n; j++) {
	dp[i + j * j] = Math.min(dp[i] + 1, dp[i + j * j]);
	}
	}
	return dp[n];
	}
	}

view raw numSquares.java hosted with ❤ by GitHub

初始化还把值搞错了，竟然溢出啦～
报名参加比赛，然后不做题，排名竟然会倒退！！！