Refine

begeekmyfriend · begeekmyfriend · commit 8f7fe310845c · 2020-06-02T16:10:19.000+08:00
Signed-off-by: begeekmyfriend &lt;begeekmyfriend@gmail.com&gt;
diff --git a/003_longest_substring_without_repeat/longest_substring_without_repeat.c b/003_longest_substring_without_repeat/longest_substring_without_repeat.c
@@ -15,8 +15,10 @@ static int lengthOfLongestSubstring(char *s)
             len++;
         } else {
             if (index - offset[*s] > len) {
+                /* not include in substring, go on increasing */
                 len++;
             } else {
+                /* count from scratch */
 	        len = index - offset[*s];
             }
         }
diff --git a/004_median_of_two_sorted_array/median_of_two_sorted_array.c b/004_median_of_two_sorted_array/median_of_two_sorted_array.c
@@ -1,42 +1,27 @@
 #include <stdio.h>
 #include <stdlib.h>
 
-static double find_kth(int a[], int alen, int b[], int blen, int k)  
-{  
-    /* Always assume that alen is equal or smaller than blen */ 
-    if (alen > blen) {
-        return find_kth(b, blen, a, alen, k);
-    }
-
-    if (alen == 0) {
-        return b[k - 1];
-    }
-
-    if (k == 1) {
-        return a[0] < b[0] ? a[0] : b[0];
-    }
-
-    /* Divide k into two parts */
-    int ia = k / 2 < alen ? k / 2 : alen;
-    int ib = k - ia;  
-    if (a[ia - 1] < b[ib - 1]) {
-        /* a[ia - 1] must be ahead of k-th */
-        return find_kth(a + ia, alen - ia, b, blen, k - ia);
-    } else if (a[ia - 1] > b[ib - 1]) {  
-        /* b[ib - 1] must be ahead of k-th */
-        return find_kth(a, alen, b + ib, blen - ib, k - ib);
-    } else {
-        return a[ia - 1];
-    }
-}
-
 static double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size)
 {
-    int half = (nums1Size + nums2Size) / 2;
-    if ((nums1Size + nums2Size) & 0x1) {
-        return find_kth(nums1, nums1Size, nums2, nums2Size, half + 1);
+    int sum = nums1Size + nums2Size;
+    int *nums = malloc(sizeof(int) * sum);
+    int i = 0, j = 0, k = 0;
+    int half = sum / 2 + 1;
+    while (k < half) {
+        int n;
+        if (i < nums1Size && j < nums2Size) {
+            n = (nums1[i] < nums2[j]) ? nums1[i++] : nums2[j++];
+        } else if (i < nums1Size) {
+            n = nums1[i++];
+        } else if (j < nums2Size) {
+            n = nums2[j++];
+        }
+        nums[k++] = n;
+    }
+    if (sum % 2) {
+        return nums[k-1];
     } else {
-        return (find_kth(nums1, nums1Size, nums2, nums2Size, half) + find_kth(nums1, nums1Size, nums2, nums2Size, half + 1)) / 2;
+        return (nums[k-1] + nums[k-2]) / 2.0;
     }
 }
 

Original file line number	Diff line number	Diff line change
`@@ -15,8 +15,10 @@ static int lengthOfLongestSubstring(char *s)`
`15`	`15`	`len++;`
`16`	`16`	`} else {`
`17`	`17`	`if (index - offset[*s] > len) {`
	`18`	`+ /* not include in substring, go on increasing */`
`18`	`19`	`len++;`
`19`	`20`	`} else {`
	`21`	`+ /* count from scratch */`
`20`	`22`	`len = index - offset[*s];`
`21`	`23`	`}`
`22`	`24`	`}`