Commit 2f50e4b

committed

[20230412] Solve easy problem

1 parent b9a3169 commit 2f50e4bCopy full SHA for 2f50e4b

File tree

+35

-0

lines changed

README.md
🙂easy/2164.Sort-Even-and-Odd-Indices-Independently
- sort_even_and_odd_indices_independently.py

+35

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,8 @@`
`2`	`2`
`3`	`3`	`[![forthebadge](https://forthebadge.com/images/badges/made-with-python.svg)](https://forthebadge.com)`
`4`	`4`
	`5`	`+> 🫠 NO MORE UPDATE README.md`
	`6`	`+`
`5`	`7`	`## Problems`
`6`	`8`
`7`	`9`	`\| # \| title \| difficulty \| languages \| tag \|`

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,33 @@`
	`1`	`+# 2164. Sort Even and Odd Indices Independently`
	`2`	`+# https://leetcode.com/problems/sort-even-and-odd-indices-independently/description/`
	`3`	`+from typing import List`
	`4`	`+`
	`5`	`+`
	`6`	`+class Solution:`
	`7`	`+ def sortEvenOdd(self, nums: List[int]) -> List[int]:`
	`8`	`+ even_nums = []`
	`9`	`+ odd_nums = []`
	`10`	`+`
	`11`	`+ for i in range(len(nums)):`
	`12`	`+ if i % 2 == 0:`
	`13`	`+ even_nums.append(nums[i])`
	`14`	`+ else:`
	`15`	`+ odd_nums.append(nums[i])`
	`16`	`+`
	`17`	`+ even_nums.sort()`
	`18`	`+ odd_nums.sort(reverse=True)`
	`19`	`+`
	`20`	`+ i, j = 0, 0`
	`21`	`+ k = 0`
	`22`	`+ result = [0 for _ in range(len(nums))]`
	`23`	`+ while i < len(even_nums):`
	`24`	`+ result[k] = even_nums[i]`
	`25`	`+ i += 1`
	`26`	`+ k += 2`
	`27`	`+`
	`28`	`+ k = 1`
	`29`	`+ while j < len(odd_nums):`
	`30`	`+ result[k] = odd_nums[j]`
	`31`	`+ j += 1`
	`32`	`+ k += 2`
	`33`	`+ return result`

Comments

(0)