-
-
Notifications
You must be signed in to change notification settings - Fork 298
/
Copy path905.py
28 lines (28 loc) · 998 Bytes
/
905.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
__________________________________________________________________________________________________
sample 76 ms submission
class Solution:
def sortArrayByParity(self, A: List[int]) -> List[int]:
b = []
c = []
for i in A:
if i%2 == 0:
b.append(i)
else:
c.append(i)
return (b+c)
# B = (lambda x: x%2==1)
# print (B)
__________________________________________________________________________________________________
sample 13304 kb submission
class Solution:
def sortArrayByParity(self, A: List[int]) -> List[int]:
oddnums = [];
evennums = [];
for i in range(0,len(A)):
if(A[i]%2 ==0):
evennums.append(A[i]);
else:
oddnums.append(A[i]);
print(evennums,oddnums)
return evennums+oddnums;
__________________________________________________________________________________________________