Improvement

Signed-off-by: begeekmyfriend <[email protected]>

Author: begeekmyfriend

0026_remove_duplicates_from_sorted_array/rm_dup.c

@@ -1,20 +1,17 @@
 #include <stdio.h>
 #include <stdlib.h>
 
+
 static int removeDuplicates(int* nums, int numsSize)
 {
-    if (numsSize <= 1) {
-        return numsSize;
-    }
-
-    int i, count = 1;
+    int i, size = 0;
     for (i = 1; i < numsSize; i++) {
-        if (nums[i - 1] != nums[i]) {
-            nums[count++] = nums[i];
+        if (nums[size] != nums[i]) {
+            nums[++size] = nums[i];
         }
     }
 
-    return count;
+    return size + 1;
 }
 
 int main(int argc, char **argv)

0026_remove_duplicates_from_sorted_array/rm_dup.cc

@@ -5,16 +5,13 @@ using namespace std;
 class Solution {
 public:
     int removeDuplicates(vector<int>& nums) {
-        if (nums.size() == 0) {
-            return 0;
-        }
-
-        int count = 1;
+        int size = 0;
         for (int i = 1; i < nums.size(); i++) {
-            if (nums[i - 1] != nums[i]) {
-                nums[count++] = nums[i];
+            if (nums[size] != nums[i]) {
+                nums[++size] = nums[i];
             }
         }
-        return count;
+
+        return size + 1;
     }
 };

0070_climbing_stairs/climb_stairs.c

@@ -2,28 +2,28 @@
 #include <stdlib.h>
 #include <string.h>
 
-static int dfs(int n, int *count)
+static int dfs(int n, int *steps)
 {
     if (n == 1) {
         return 1;
     } else if (n == 2) {
         return 2;
-    } else if (count[n] > 0) {
-        return count[n];
+    } else if (steps[n] > 0) {
+        return steps[n];
     } else {
-        count[n] += dfs(n - 1, count);
-        count[n] += dfs(n - 2, count);
-        return count[n];
+        steps[n] += dfs(n - 1, steps);
+        steps[n] += dfs(n - 2, steps);
+        return steps[n];
     }
 }
 
 static int climbStairs(int n)
 {
 #if 1
     if (n < 1) return 0;
-    int *count = malloc((n + 1) * sizeof(int));
-    memset(count, 0, (n + 1) * sizeof(int));
-    return dfs(n, count);
+    int *steps = malloc((n + 1) * sizeof(int));
+    memset(steps, 0, (n + 1) * sizeof(int));
+    return dfs(n, steps);
 #else
     int i, a = 1, b = 2, c;
     for (i = 3; i <= n; i++) {

0076_minimum_window_substring/window_substring.c

@@ -22,7 +22,7 @@ static char *minWindow(char *s, char *t)
     int l = 0, r = 0;
     int min_len = slen + 1;
     int start = 0;
-    int chars_to_meet = 0;
+    int len = 0;
 
     for (i = 0; i < tlen; i++) {
         count[t[i]]++;
@@ -31,18 +31,18 @@ static char *minWindow(char *s, char *t)
     while (r < slen) {
         if (--count[s[r++]] >= 0) {
             /* pattern found */
-            chars_to_meet++;
+            len++;
         }
 
-        while (chars_to_meet == tlen) {
+        while (len >= tlen) {
             if (r - l < min_len) {
                 min_len = r - l;
                 start = l;
             }
 
             /* Chars with negative count are not included in the pattern string */
             if (++count[s[l++]] > 0) {
-                chars_to_meet--;
+                len--;
             }
         }
     }