📝 docs : add 905. Sort Array By Parity.md

Author: GoogTech

docs/LeetCod刷题之旅及题目解析/905.按奇偶排序数组/905.按奇偶排序数组.md

@@ -0,0 +1,55 @@
+## 905. 按奇偶排序数组
+> https://leetcode-cn.com/problems/sort-array-by-parity/
+
+
+### Java
+```java
+/*
+ * @Author: Goog Tech
+ * @Date: 2020-08-16 11:39:16
+ * @LastEditTime: 2020-08-16 11:39:27
+ * @Description: https://leetcode-cn.com/problems/sort-array-by-parity/
+ * @FilePath: \leetcode-googtech\#905. Sort Array By Parity\Solution.java
+ * @WebSite: https://algorithm.show/
+ */
+
+class Solution {
+    // 双指针法
+    public int[] sortArrayByParity(int[] A) {
+        int left = 0, right = A.length - 1;
+        while(left < right) {
+            while(left < right && A[left] % 2 == 0) left++;
+            while(left < right && A[right] % 2 != 0) right--;
+            int temp = A[left];
+            A[left] = A[right];
+            A[right] = temp;
+        }
+        return A;
+    }
+}
+```
+
+### Python
+```python
+'''
+Author: Goog Tech
+Date: 2020-08-16 11:39:20
+LastEditTime: 2020-08-16 11:39:46
+Description: https://leetcode-cn.com/problems/sort-array-by-parity/
+FilePath: \leetcode-googtech\#905. Sort Array By Parity\Solution.py
+WebSite: https://algorithm.show/
+'''
+
+class Solution(object):
+    def sortArrayByParity(self, A):
+        """
+        :type A: List[int]
+        :rtype: List[int]
+        """
+        i = 0
+        for j in range(len(A)):
+            if A[j] % 2 == 0:
+                A[i], A[j] = A[j], A[i]
+                i += 1
+        return A
+```

docs/SUMMARY.md

@@ -77,6 +77,7 @@
     * [700.二叉搜索树中的搜索](LeetCod刷题之旅及题目解析/700.二叉搜索树中的搜索/700.二叉搜索树中的搜索.md)
     * [709.转换成小写字母](LeetCod刷题之旅及题目解析/709.转换成小写字母/709.转换成小写字母.md)
     * [876.链表的中间结点](LeetCod刷题之旅及题目解析/876.链表的中间结点/876.链表的中间结点.md)
+    * [905.按奇偶排序数组](LeetCod刷题之旅及题目解析/905.按奇偶排序数组/905.按奇偶排序数组.md)
     * [938.二叉搜索树的范围和](LeetCod刷题之旅及题目解析/938.二叉搜索树的范围和/938.二叉搜索树的范围和.md)
     * [977.有序数组的平方](LeetCod刷题之旅及题目解析/977.有序数组的平方/977.有序数组的平方.md)
     * [1021.删除最外层的括号](LeetCod刷题之旅及题目解析/1021.删除最外层的括号/1021.删除最外层的括号.md)