Hi all,

I have the code for this question, pretty straightforward:

```
class Solution:
# @param {integer[]} nums
# @return {integer}
def removeDuplicates(self, nums):
self.nums = nums
s = len(nums)
if s == 0 or s == 1:
return s
k = nums[0]
for i in nums[1:]:
if i-k == 0:
s = s-1
else:
k = i
return s
```

Based on the problem, the required output should be the length with no repeated numbers.

But I have this error:

Input: [1,1,2] Output: [1,1] Expected: [1,2]

actually, I tested this on Pycharm, the output is 2...

Leetcode has system error?

Thanks