class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
count = len(nums)
if len(nums) == 0:
return 0
ptr1 = 0
ptr2 = len(nums) -1
for i in range(len(nums)):
if nums[i] == val:
count-=1
while ptr1 != ptr2:
if nums[ptr1] == val:
nums[ptr1] , nums[ptr2] = nums[ptr2], nums[ptr1]
ptr2-=1
else:
ptr1+=1
return count
785. Is Graph Bipartite | 90. Subsets II |
1560A - Dislike of Threes | 36. Valid Sudoku |
557. Reverse Words in a String III | 566. Reshape the Matrix |
167. Two Sum II - Input array is sorted | 387. First Unique Character in a String |
383. Ransom Note | 242. Valid Anagram |
141. Linked List Cycle | 21. Merge Two Sorted Lists |
203. Remove Linked List Elements | 733. Flood Fill |
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |
77. Combinations | 46. Permutations |
226. Invert Binary Tree | 112. Path Sum |
1556A - A Variety of Operations | 136. Single Number |
169. Majority Element | 119. Pascal's Triangle II |
409. Longest Palindrome | 1574A - Regular Bracket Sequences |