⚡ perf: delete dynamic array

liuchuo · Mar 19, 2019 · a240dc4 · a240dc4
1 parent 0965714
commit a240dc4
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 12 deletions.
diff --git a/AdvancedLevel_C++/1089. Insert or Merge (25).cpp b/AdvancedLevel_C++/1089. Insert or Merge (25).cpp
@@ -2,15 +2,12 @@
 #include <algorithm>
 using namespace std;
 int main() {
-    int n;
+    int n, a[100], b[100], i, j;
     cin >> n;
-    int *a = new int [n];
-    int *b = new int [n];
     for (int i = 0; i < n; i++)
         cin >> a[i];
     for (int i = 0; i < n; i++)
         cin >> b[i];
-    int i, j;
     for (i = 0; i < n - 1 && b[i] <= b[i + 1]; i++);
     for (j = i + 1; a[j] == b[j] && j < n; j++);
     if (j == n) {
@@ -35,7 +32,5 @@ int main() {
         if (j != 0) printf(" ");
         printf("%d", a[j]);
     }
-    delete [] a;
-    delete [] b;
     return 0;
 }
diff --git a/BasicLevel_C++/1035. 插入与归并(25).cpp b/BasicLevel_C++/1035. 插入与归并(25).cpp
@@ -2,15 +2,12 @@
 #include <algorithm>
 using namespace std;
 int main() {
-    int n;
+    int n, a[100], b[100], i, j;
     cin >> n;
-    int *a = new int [n];
-    int *b = new int [n];
     for (int i = 0; i < n; i++)
         cin >> a[i];
     for (int i = 0; i < n; i++)
         cin >> b[i];
-    int i, j;
     for (i = 0; i < n - 1 && b[i] <= b[i + 1]; i++);
     for (j = i + 1; a[j] == b[j] && j < n; j++);
     if (j == n) {
@@ -35,7 +32,5 @@ int main() {
         if (j != 0) printf(" ");
         printf("%d", a[j]);
     }
-    delete [] a;
-    delete [] b;
     return 0;
 }