8000 * Done with "2164. Sort Even and Odd Indices Independently". · garciparedes/leetcode@daf25fa · GitHub
[go: up one dir, main page]

Skip to content

Commit daf25fa

Browse files
committed
* Done with "2164. Sort Even and Odd Indices Independently".
1 parent 9420a5a commit daf25fa

File tree

1 file changed

+21
-0
lines changed

1 file changed

+21
-0
lines changed
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
class Solution:
2+
def sortEvenOdd(self, nums: List[int]) -> List[int]:
3+
odds = list()
4+
evens = list()
5+
6+
for i, num in enumerate(nums):
7+
if i % 2:
8+
evens.append(num)
9+
else:
10+
odds.append(num)
11+
12+
odds.sort()
13+
evens.sort(reverse=True)
14+
15+
for i in range(len(nums)):
16+
if i % 2:
17+
nums[i] = evens[i // 2]
18+
else:
19+
nums[i] = odds[i // 2]
20+
21+
return nums

0 commit comments

Comments
 (0)
0