algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2119 from Lozakaka/patch-17

Browse Source 
編輯JAVA解答的部分內容
This commit is contained in:
程序员Carl
2023-06-17 08:09:52 +08:00
committed by GitHub
parent 49d94a3fa9 32185d5f2d
commit 59a9280205
1 changed files with 6 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/0279.完全平方数.md
View File

@ -177,15 +177,19 @@ class Solution {
for (int j = 0; j <= n; j++) { for (int j = 0; j <= n; j++) {
dp[j] = max; dp[j] = max;
} }
//如果不想要寫for-loop填充數組的話，也可以用JAVA內建的Arrays.fill()函數。
//Arrays.fill(dp, Integer.MAX_VALUE);
//当和为0时，组合的个数为0 //当和为0时，组合的个数为0
dp[0] = 0; dp[0] = 0;
// 遍历物品 // 遍历物品
for (int i = 1; i * i <= n; i++) { for (int i = 1; i * i <= n; i++) {
// 遍历背包 // 遍历背包
for (int j = i * i; j <= n; j++) { for (int j = i * i; j <= n; j++) {
if (dp[j - i * i] != max) { //if (dp[j - i * i] != max) {
dp[j] = Math.min(dp[j], dp[j - i * i] + 1); dp[j] = Math.min(dp[j], dp[j - i * i] + 1);
} //}
//不需要這個if statement，因爲在完全平方數這一題不會有"湊不成"的狀況發生（ 一定可以用"1"來組成任何一個n），故comment掉這個if statement。
} }
} }
return dp[n]; return dp[n];