Update 1649.Create-Sorted-Array-through-Instructions_DivideConque.cpp

lijing-code · Jun 27, 2022 · a5504ee · a5504ee
1 parent fe1779d
commit a5504ee
Showing 1 changed file with 31 additions and 32 deletions.
diff --git a/...Array-through-Instructions/1649.Create-Sorted-Array-through-Instructions_DivideConque.cpp b/...Array-through-Instructions/1649.Create-Sorted-Array-through-Instructions_DivideConque.cpp
@@ -35,37 +35,36 @@ class Solution {
             numSmaller[i] += iter-(sorted+a);
         }
 
-        int i=a, j=mid+1, p = 0;        
-        while (i<=mid && j<=b)
-        {
-            if (sorted[i]<=sorted[j])
-            {
-                temp[p] = sorted[i];
-                i++;
-            }                
-            else
-            {
-                temp[p] = sorted[j];
-                j++;
-            } 
-            p++;
-        }
-        while (i<=mid)
-        {
-            temp[p] = sorted[i];
-            i++;
-            p++;
-        }
-        while (j<=b)
-        {
-            temp[p] = sorted[j];
-            j++;
-            p++;
-        }
-        for (int i=0; i<b-a+1; i++)
-            sorted[a+i] = temp[i];
+        inplace_merge(sorted+a, sorted+mid+1, sorted+b+1);
+
+        // int i=a, j=mid+1, p = 0;        
+        // while (i<=mid && j<=b)
+        // {
+        //     if (sorted[i]<=sorted[j])
+        //     {
+        //         temp[p] = sorted[i];
+        //         i++;
+        //     }                
+        //     else
+        //     {
+        //         temp[p] = sorted[j];
+        //         j++;
+        //     } 
+        //     p++;
+        // }
+        // while (i<=mid)
+        // {
+        //     temp[p] = sorted[i];
+        //     i++;
+        //     p++;
+        // }
+        // while (j<=b)
+        // {
+        //     temp[p] = sorted[j];
+        //     j++;
+        //     p++;
+        // }
+        // for (int i=0; i<b-a+1; i++)
+        //     sorted[a+i] = temp[i];
     }
 };
-
-
-// X X 3 X   3 Y Y Y