57 lines
1.0 KiB
Python
57 lines
1.0 KiB
Python
# @leet imports start
|
|
from string import *
|
|
from re import *
|
|
from datetime import *
|
|
from collections import *
|
|
from heapq import *
|
|
from bisect import *
|
|
from copy import *
|
|
from math import *
|
|
from random import *
|
|
from statistics import *
|
|
from itertools import *
|
|
from functools import *
|
|
from operator import *
|
|
from io import *
|
|
from sys import *
|
|
from json import *
|
|
from builtins import *
|
|
import string
|
|
import re
|
|
import datetime
|
|
import collections
|
|
import heapq
|
|
import bisect
|
|
import copy
|
|
import math
|
|
import random
|
|
import statistics
|
|
import itertools
|
|
import functools
|
|
import operator
|
|
import io
|
|
import sys
|
|
import json
|
|
from typing import *
|
|
# @leet imports end
|
|
|
|
# @leet start
|
|
class Solution:
|
|
def removeDuplicates(self, nums: List[int]) -> int:
|
|
if not nums:
|
|
return 0
|
|
if len(nums) <= 2:
|
|
return len(nums)
|
|
k = 2
|
|
for i in range(2, len(nums)):
|
|
if nums[i] != nums[k - 1] or nums[i] != nums[k - 2]:
|
|
nums[k] = nums[i]
|
|
k += 1
|
|
print(nums)
|
|
|
|
return k
|
|
|
|
|
|
|
|
# @leet end
|