Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution:
- def rearrangeArray(self, nums: List[int]) -> List[int]:
- n = len(nums)//2
- pos, neg = 0, 0
- ans = []
- for i in range(n):
- while nums[pos] < 0:
- pos += 1
- ans.append(nums[pos])
- pos += 1
- while nums[neg] > 0:
- neg += 1
- ans.append(nums[neg])
- neg += 1
- return ans
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement