Add solution for leetcode_26

This commit is contained in:
pro100ton 2024-12-27 11:12:49 +03:00
parent 8ada2330d5
commit 1c5b792565
2 changed files with 47 additions and 0 deletions

View file

@ -0,0 +1,26 @@
package main
import "fmt"
func removeDuplicates(nums []int) int {
if len(nums) == 1 {
return 1
}
var unique, rp int = 0, 0
for i := 0; i < len(nums); i++ {
if nums[rp] != nums[i] {
unique++
rp++
nums[rp] = nums[i]
}
}
return unique + 1
}
func main() {
nums := []int{1, 1, 2}
// nums := []int{0, 0, 1, 1, 1, 2, 2, 3, 3, 4}
res := removeDuplicates(nums)
fmt.Println(res)
fmt.Println(nums)
}

View file

@ -0,0 +1,21 @@
from typing import List
class Solution:
def removeDuplicates(self, nums: List[int]) -> int:
if len(nums) <= 1:
return 0
unique, iteratror, real_pose = 1, 1, 0
while iteratror < len(nums):
if nums[real_pose] != nums[iteratror]:
unique += 1
real_pose += 1
nums[real_pose] = nums[iteratror]
iteratror += 1
return unique
if __name__ == "__main__":
# nums = [1, 1, 2]
nums = [0,0,1,1,1,2,2,3,3,4]
print(Solution().removeDuplicates(nums))
print(nums)