lurenaa的博客

  

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
set<int> st;
int k = 0;
for(int i = 0; i < nums.size(); ++i) {
if(!st.count(nums[i])) {
nums[k++] = nums[i];
st.insert(nums[i]);
}
}
return st.size();
}
};

Accepted

161/161 cases passed (20 ms)

Your runtime beats 72.01 % of cpp submissions

Your memory usage beats 5.09 % of cpp submissions (11.9 MB)