Update comments

begeekmyfriend · begeekmyfriend · commit db352a9121c4 · 2023-10-21T18:58:50.000+08:00
Signed-off-by: begeekmyfriend &lt;begeekmyfriend@gmail.com&gt;
diff --git a/0046_permutations/permutations.c b/0046_permutations/permutations.c
@@ -41,16 +41,18 @@ static void dfs(int *nums, int size, bool *used, int *stack,
         memcpy(results[*count], stack, size * sizeof(int));
         col_size[*count] = size;
         (*count)++;
-    } else {
-        /* Reverse order is allowed in different levels, always starts from [0] */
-        for (i = 0; i < size; i++) {
-            if (!used[i]) {
-                /* Used marks only allows remaining elements in DFS levels */
-                used[i] = true;
-                stack[len] = nums[i];
-                dfs(nums, size, used, stack, len + 1, results, count, col_size);
-                used[i] = false;
-            }
+        return;
+    }
+
+    /* Reverse order is allowed in different levels, always starts from [0] */
+    for (i = 0; i < size; i++) {
+        if (!used[i]) {
+            /* Used marks all the allowable remaining elements in the next DFS
+             * levels */
+            stack[len] = nums[i];
+            used[i] = true;
+            dfs(nums, size, used, stack, len + 1, results, count, col_size);
+            used[i] = false;
         }
     }
 }
diff --git a/0046_permutations/permutations.cc b/0046_permutations/permutations.cc
@@ -16,17 +16,19 @@ class Solution {
     void dfs(vector<int>& nums, vector<bool>& used, vector<vector<int>>& res) {
         if (stack.size() == nums.size()) {
             res.push_back(stack);
-        } else {
-            // Reverse order is allowed in different levels, always starts from [0]
-            for (int i = 0; i < nums.size(); i++) {
-                if (!used[i]) {
-                    // Used marks only allows remaining elements in DFS levels
-                    used[i] = true;
-                    stack.push_back(nums[i]);
-                    dfs(nums, used, res);
-                    stack.pop_back();
-                    used[i] = false;
-                }
+            return;
+        }
+
+        // Reverse order is allowed in different levels, always starts from [0]
+        for (int i = 0; i < nums.size(); i++) {
+            if (!used[i]) {
+                // Used marks all the allowable remaining elements in the next
+                // DFS levels
+                used[i] = true;
+                stack.push_back(nums[i]);
+                dfs(nums, used, res);
+                stack.pop_back();
+                used[i] = false;
             }
         }
     }
diff --git a/0047_permutations_ii/permutations.c b/0047_permutations_ii/permutations.c
@@ -12,26 +12,29 @@ static void dfs(int *nums, int size, bool *used, int *stack,
                 int len, int **results, int *count, int *col_size)
 {
     int i;
+
     if (len == size) {
         results[*count] = malloc(len * sizeof(int));
         memcpy(results[*count], stack, len * sizeof(int));
         col_size[*count] = size;
         (*count)++;
-    } else {
-        /* Reverse order is allowed in different levels, always starts from [0] */
-        for (i = 0; i < size; i++) {
-            /* Used marks only allows remaining elements in DFS levels */
-            if (!used[i]) {
-                if (i > 0 && !used[i - 1] && nums[i - 1] == nums[i]) {
-                    /* In case duplicate permutation with same elemements in the same postion */
-                    /* used[i - 1] == true means different level position */
-                    continue;
-                }
-                used[i] = true;
-                stack[len] = nums[i];
-                dfs(nums, size, used, stack, len + 1, results, count, col_size);
-                used[i] = false;
+        return;
+    }
+
+    /* Reverse order is allowed in different levels, always starts from [0] */
+    for (i = 0; i < size; i++) {
+        /* used marks remaining allowable elements in the next DFS level */
+        if (!used[i]) {
+            if (i > 0 && !used[i - 1] && nums[i - 1] == nums[i]) {
+                /* !used[i - 1] means the upper DFS level does not contain
+                 * nums[i - 1] such that we need to exclude the duplicate
+                 * enumeration that has been recorded with used[i - 1]==true. */
+                continue;
             }
+            stack[len] = nums[i];
+            used[i] = true;
+            dfs(nums, size, used, stack, len + 1, results, count, col_size);
+            used[i] = false;
         }
     }
 }
diff --git a/0047_permutations_ii/permutations.cc b/0047_permutations_ii/permutations.cc
@@ -19,11 +19,12 @@ class Solution {
             res.push_back(stack);
         } else {
             for (int i = 0; i < nums.size(); i++) {
-                // Used marks only allows remaining elements in DFS levels
+                // used marks remaining allowable elements in the next DFS level
                 if (!used[i]) {
                     if (i > 0 && !used[i - 1] && nums[i - 1] == nums[i]) {
-                        // In case duplicate permutation with same elemements in the same postion
-                        // used[i - 1] == true means different level position
+                        // !used[i - 1] means the upper DFS level does not contain
+                        // nums[i - 1] such that we need to exclude the duplicate
+                        // enumeration that has been recorded with used[i-1]==true.
                         continue;
                     }
                     stack.push_back(nums[i]);
