feat: update solutions to leetcode problem: No.0905. Sort Array By Parity

yanglbme · yanglbme · commit e41ebf551bf4 · 2021-05-06T23:50:51.000+08:00
diff --git a/solution/0900-0999/0905.Sort Array By Parity/README.md b/solution/0900-0999/0905.Sort Array By Parity/README.md
@@ -28,27 +28,83 @@
 	<li><code>0 &lt;= A[i] &lt;= 5000</code></li>
 </ol>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+双指针原地交换数组元素。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def sortArrayByParity(self, A: List[int]) -> List[int]:
+        i, j = 0, len(A) - 1
+        while i < j:
+            if (A[i] & 1) > (A[j] & 1):
+                A[i], A[j] = A[j], A[i]
+            if A[i] & 1 == 0:
+                i += 1
+            if A[j] & 1 == 1:
+                j -= 1
+        return A
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[] sortArrayByParity(int[] A) {
+        int i = 0, j = A.length - 1;
+        while (i < j) {
+            if ((A[i] & 1) > (A[j] & 1)) {
+                int t = A[i];
+                A[i] = A[j];
+                A[j] = t;
+            }
+            if ((A[i] & 1) == 0) {
+                ++i;
+            }
+            if ((A[j] & 1) == 1) {
+                --j;
+            }
+        }
+        return A;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} A
+ * @return {number[]}
+ */
+var sortArrayByParity = function (A) {
+  let i = 0;
+  let j = A.length - 1;
+  while (i < j) {
+    if ((A[i] & 1) > (A[j] & 1)) {
+      const t = A[i];
+      A[i] = A[j];
+      A[j] = t;
+    }
+    if ((A[i] & 1) == 0) {
+      ++i;
+    }
+    if ((A[j] & 1) == 1) {
+      --j;
+    }
+  }
+  return A;
+};
 ```
 
 ### **...**
diff --git a/solution/0900-0999/0905.Sort Array By Parity/README_EN.md b/solution/0900-0999/0905.Sort Array By Parity/README_EN.md
@@ -6,22 +6,14 @@
 
 <p>Given an array <code>A</code> of non-negative integers, return an array consisting of all the even elements of <code>A</code>, followed by all the odd elements of <code>A</code>.</p>
 
-
-
 <p>You may return any answer array that satisfies this condition.</p>
 
-
-
 <p>&nbsp;</p>
 
-
-
 <div>
 
 <p><strong>Example 1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input: </strong><span id="example-input-1-1">[3,1,2,4]</span>
@@ -32,39 +24,86 @@ The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
 
 </pre>
 
-
-
 <p>&nbsp;</p>
 
-
-
 <p><strong>Note:</strong></p>
 
-
-
 <ol>
 	<li><code>1 &lt;= A.length &lt;= 5000</code></li>
 	<li><code>0 &lt;= A[i] &lt;= 5000</code></li>
 </ol>
 
 </div>
 
-
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def sortArrayByParity(self, A: List[int]) -> List[int]:
+        i, j = 0, len(A) - 1
+        while i < j:
+            if (A[i] & 1) > (A[j] & 1):
+                A[i], A[j] = A[j], A[i]
+            if A[i] & 1 == 0:
+                i += 1
+            if A[j] & 1 == 1:
+                j -= 1
+        return A
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[] sortArrayByParity(int[] A) {
+        int i = 0, j = A.length - 1;
+        while (i < j) {
+            if ((A[i] & 1) > (A[j] & 1)) {
+                int t = A[i];
+                A[i] = A[j];
+                A[j] = t;
+            }
+            if ((A[i] & 1) == 0) {
+                ++i;
+            }
+            if ((A[j] & 1) == 1) {
+                --j;
+            }
+        }
+        return A;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} A
+ * @return {number[]}
+ */
+var sortArrayByParity = function (A) {
+  let i = 0;
+  let j = A.length - 1;
+  while (i < j) {
+    if ((A[i] & 1) > (A[j] & 1)) {
+      const t = A[i];
+      A[i] = A[j];
+      A[j] = t;
+    }
+    if ((A[i] & 1) == 0) {
+      ++i;
+    }
+    if ((A[j] & 1) == 1) {
+      --j;
+    }
+  }
+  return A;
+};
 ```
 
 ### **...**
diff --git a/solution/0900-0999/0905.Sort Array By Parity/Solution.java b/solution/0900-0999/0905.Sort Array By Parity/Solution.java
@@ -0,0 +1,19 @@
+class Solution {
+    public int[] sortArrayByParity(int[] A) {
+        int i = 0, j = A.length - 1;
+        while (i < j) {
+            if ((A[i] & 1) > (A[j] & 1)) {
+                int t = A[i];
+                A[i] = A[j];
+                A[j] = t;
+            }
+            if ((A[i] & 1) == 0) {
+                ++i;
+            }
+            if ((A[j] & 1) == 1) {
+                --j;
+            }
+        }
+        return A;
+    }
+}
diff --git a/solution/0900-0999/0905.Sort Array By Parity/Solution.js b/solution/0900-0999/0905.Sort Array By Parity/Solution.js
@@ -2,53 +2,21 @@
  * @param {number[]} A
  * @return {number[]}
  */
-// 第一次的做法
 var sortArrayByParity = function (A) {
-  const len = A.length;
-  if (len == 1) return A;
-  let evenNumber = [];
-  let oddNumber = [];
-  for (let i = 0; i < len; i++) {
-    if (A[i] % 2 == 0) {
-      evenNumber.push(A[i]);
-    }
-    if (A[i] % 2 != 0) {
-      oddNumber.push(A[i]);
-    }
-  }
-  return evenNumber.concat(oddNumber);
-};
-// 修改第一次的代码,只使用一个数组，减少一次合并数组操作
-var sortArrayByParity = function (A) {
-  const len = A.length;
-  if (len == 1) return A;
-  let eoNum = [];
-  for (let i = 0; i < len; i++) {
-    if (A[i] % 2 == 1) {
-      eoNum.push(A[i]);
+  let i = 0;
+  let j = A.length - 1;
+  while (i < j) {
+    if ((A[i] & 1) > (A[j] & 1)) {
+      const t = A[i];
+      A[i] = A[j];
+      A[j] = t;
     }
-    if (A[i] % 2 == 0) {
-      eoNum.unshift(A[i]);
+    if ((A[i] & 1) == 0) {
+      ++i;
     }
-  }
-  return eoNum;
-};
-// 双指针做法,无需新数组，push和unshift操作，利用第三个变量进行交换
-var sortArrayByParity = function (A) {
-  const len = A.length;
-  if (len == 1) return A;
-  let i = 0,
-    j = len - 1;
-  while (i < j) {
-    if (A[i] % 2 == 1 && A[j] % 2 == 0) {
-      let temp = A[j];
-      A[j] = A[i];
-      A[i] = temp;
-      i++;
-      j--;
+    if ((A[j] & 1) == 1) {
+      --j;
     }
-    if (A[i] % 2 == 0) i++;
-    if (A[j] % 2 == 1) j--;
   }
   return A;
 };
diff --git a/solution/0900-0999/0905.Sort Array By Parity/Solution.py b/solution/0900-0999/0905.Sort Array By Parity/Solution.py
@@ -1,8 +1,11 @@
 class Solution:
-    def sortArrayByParity(self, A):
-        """
-        :type A: List[int]
-        :rtype: List[int]
-        """
-
-        return sorted(A, key = lambda i: i % 2)
+    def sortArrayByParity(self, A: List[int]) -> List[int]:
+        i, j = 0, len(A) - 1
+        while i < j:
+            if (A[i] & 1) > (A[j] & 1):
+                A[i], A[j] = A[j], A[i]
+            if A[i] & 1 == 0:
+                i += 1
+            if A[j] & 1 == 1:
+                j -= 1
+        return A
