LeetCode905解题思路

2019年06月07日 |

leetcode/ algorithm/ easy

| algorithm

原题

905. Sort Array By Parity

Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.

You may return any answer array that satisfies this condition.

Example 1:

Input: [3,1,2,4]
Output: [2,4,3,1]
The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.

Note:

1 <= A.length <= 5000
0 <= A[i] <= 5000

解题思路

看到这题可以发现首先需要辨别出奇偶数，然后分别存储到两个slice中，最后在按先偶后奇的顺序合并为一个slice。
总的来说就是用空间换时间。

代码实现

Golang实现

https://github.com/cook-coder/my-leetcode-solution/tree/master/easy/905

成绩