Commit 8d56e09

committed

solves remove element

1 parent f751b59 commit 8d56e09Copy full SHA for 8d56e09

File tree

+23

-1

lines changed

+23

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -25,7 +25,7 @@`
`25`	`25`	`## Deleting Items From An Array`
`26`	`26`	`\| Question \| Solution \| Youtube \|`
`27`	`27`	`\|------\|:--------:\|:----------------------:\|`
`28`		`-\| [Remove Element](https://leetcode.com/explore/learn/card/fun-with-arrays/526/deleting-items-from-an-array/3247/) \| [![Java](assets/java.png)](java/src/) [![Python](assets/python.png)](python/) \|`
	`28`	`+\| [Remove Element](https://leetcode.com/explore/learn/card/fun-with-arrays/526/deleting-items-from-an-array/3247/) \| [![Java](assets/java.png)](java/src/RemoveElement.java) [![Python](assets/python.png)](python/remove_element.py) \|`
`29`	`29`	`\| [Remove Duplicates from Sorted Array](https://leetcode.com/explore/learn/card/fun-with-arrays/526/deleting-items-from-an-array/3248/) \| [![Java](assets/java.png)](java/src/) [![Python](assets/python.png)](python/) \|`
`30`	`30`
`31`	`31`

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,11 @@`
	`1`	`+public class RemoveElement {`
	`2`	`+ public int removeElement(int[] nums, int val) {`
	`3`	`+ int j = 0;`
	`4`	`+ for (int i = 0 ; i < nums.length ; i++) {`
	`5`	`+ if (nums[i] != val) {`
	`6`	`+ nums[j++] = nums[i];`
	`7`	`+ }`
	`8`	`+ }`
	`9`	`+ return j;`
	`10`	`+ }`
	`11`	`+}`

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,11 @@`
	`1`	`+from typing import List`
	`2`	`+`
	`3`	`+`
	`4`	`+class Solution:`
	`5`	`+ def removeElement(self, nums: List[int], val: int) -> int:`
	`6`	`+ finalLength = 0`
	`7`	`+ for element in nums:`
	`8`	`+ if element is not val:`
	`9`	`+ nums[finalLength] = element`
	`10`	`+ finalLength += 1`
	`11`	`+ return finalLength`

Comments

(0)