Refine

begeekmyfriend · begeekmyfriend · commit 022a196e2e2f · 2020-07-20T21:12:48.000+08:00
Signed-off-by: begeekmyfriend &lt;begeekmyfriend@gmail.com&gt;
diff --git a/026_remove_duplicates_from_sorted_array/rm_dup.c b/026_remove_duplicates_from_sorted_array/rm_dup.c
@@ -7,13 +7,11 @@ static int removeDuplicates(int* nums, int numsSize)
         return numsSize;
     }
 
-    int i = 0, j, count = 1;
-    while (i < numsSize) {
-        for (j = i + 1; j < numsSize && nums[i] == nums[j]; j++) {}
-        if (j < numsSize) {
-            nums[count++] = nums[j];
+    int i, count = 1;
+    for (i = 1; i < numsSize; i++) {
+        if (nums[i - 1] != nums[i]) {
+            nums[count++] = nums[i];
         }
-        i = j;
     }
 
     return count;
diff --git a/029_divide_two_integers/divide.c b/029_divide_two_integers/divide.c
@@ -4,34 +4,38 @@
 
 int divide(int dividend, int divisor)
 {
-    int sign = (float) dividend / divisor > 0 ? 1 : -1;
-    unsigned int dvd = dividend > 0 ? dividend : -dividend;
-    unsigned int dvs = divisor > 0 ? divisor : -divisor;
-    unsigned int bit_num[33];
-    unsigned int i = 0;
-    long long d = dvs;
+    int signal = 1;
+    unsigned int dvd = dividend;
+    if (dividend < 0) {
+        signal *= -1;
+        dvd = ~dvd + 1;
+    }
+
+    unsigned int dvs = divisor;
+    if (divisor < 0) {
+        signal *= -1;
+        dvs = ~dvs + 1;
+    }
 
-    bit_num[i] = d;
-    while (d <= dvd) {
-        bit_num[++i] = d = d << 1;
+    int shift = 0;
+    while (dvd > dvs << shift) {
+        shift++;
     }
-    i--;
 
-    unsigned int result = 0;
+    unsigned int res = 0;
     while (dvd >= dvs) {
-        if (dvd >= bit_num[i]) {
-            dvd -= bit_num[i];
-            result += (1<<i);
-        } else {
-            i--;
+        while (dvd < dvs << shift) {
+            shift--;
         }
+        res |= (unsigned int) 1 << shift;
+        dvd -= dvs << shift;
     }
 
-    //becasue need to return `int`, so we need to check it is overflowed or not.
-    if (result > INT_MAX && sign > 0) {
+    if (signal == 1 && res >= INT_MAX) {
         return INT_MAX;
+    } else {
+        return res * signal;
     }
-    return (int) result * sign;
 }
 
 int main(int argc, char **argv)

Original file line number	Diff line number	Diff line change
`@@ -7,13 +7,11 @@ static int removeDuplicates(int* nums, int numsSize)`
`7`	`7`	`return numsSize;`
`8`	`8`	`}`
`9`	`9`
`10`		`- int i = 0, j, count = 1;`
`11`		`- while (i < numsSize) {`
`12`		`- for (j = i + 1; j < numsSize && nums[i] == nums[j]; j++) {}`
`13`		`- if (j < numsSize) {`
`14`		`- nums[count++] = nums[j];`
	`10`	`+ int i, count = 1;`
	`11`	`+ for (i = 1; i < numsSize; i++) {`
	`12`	`+ if (nums[i - 1] != nums[i]) {`
	`13`	`+ nums[count++] = nums[i];`
`15`	`14`	`}`
`16`		`- i = j;`
`17`	`15`	`}`
`18`	`16`
`19`	`17`	`return count;`