mirror of
https://github.com/arkorty/LeetCode.git
synced 2026-03-17 16:51:46 +00:00
Initial commit
This commit is contained in:
13
Easy/remove-duplicates-from-sorted-array/Solution.java
Normal file
13
Easy/remove-duplicates-from-sorted-array/Solution.java
Normal file
@@ -0,0 +1,13 @@
|
||||
class Solution {
|
||||
public int removeDuplicates(int[] nums) {
|
||||
int k = 0;
|
||||
for (int i = 0, last = -101; i < nums.length; ++i) {
|
||||
if (last != nums[i]) {
|
||||
nums[k++] = nums[i];
|
||||
last = nums[i];
|
||||
}
|
||||
}
|
||||
|
||||
return k;
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user