Added Detailed solutions will be given later.

gazeldx · gazeldx · commit 925941f258e6 · 2024-12-04T17:47:57.000+08:00
diff --git a/problems/0322-coin-change.md b/problems/0322-coin-change.md
@@ -33,6 +33,8 @@ Constraints:
 ## Thoughts
 It is a `Unbounded Knapsack Problem`.
 
+Detailed solutions will be given later, and now only the best practices in 7 languages are given.
+
 ### Complexity
 * Time: `O(n * m)`.
 * Space: `O(n)`.
diff --git a/problems/0377-combination-sum-iv.md b/problems/0377-combination-sum-iv.md
@@ -42,6 +42,8 @@ All the elements of 'nums' are 'unique'.
 ## Thoughts
 This is `Unbounded Knapsack Problem` A, and it also requires us to consider the sequences.
 
+Detailed solutions will be given later, and now only the best practices in 7 languages are given.
+
 ### Complexity
 * Time: `O(n * m)`.
 * Space: `O(n)`.
@@ -127,7 +129,7 @@ public class Solution {
 var combinationSum4 = function(nums, target) {
     const dp = Array(target + 1).fill(0)
     dp[0] = 1
-    
+
     for (let i = 1; i < dp.length; i++) {
         for (const num of nums) {
             if (i >= num) {
diff --git a/problems/0518-coin-change-ii.md b/problems/0518-coin-change-ii.md
@@ -48,6 +48,8 @@ All the values of 'coins' are unique.
 ## Thoughts
 It is a `Unbounded Knapsack Problem`.
 
+Detailed solutions will be given later, and now only the best practices in 7 languages are given.
+
 ### Complexity
 * Time: `O(n * m)`.
 * Space: `O(n)`.
