728x90
반응형
문제
반응형
풀이
1
2
3
4
5
6
7
8
9
10
11
12
13
|
class Solution {
public int removeDuplicates(int[] nums) {
int answer = 1;
for(int i=0; i<nums.length-1; i++) {
if(nums[i] != nums[i+1]){
nums[answer] = nums[i+1];
answer++;
}
}
return answer;
}
}
}
|
cs |
728x90
반응형
'[JAVA] LeetCode > Easy' 카테고리의 다른 글
[LeetCode/릿코드] 35. Search Insert Position (0) | 2023.01.13 |
---|---|
[LeetCode/릿코드] 27. Remove Element (0) | 2023.01.13 |
[LeetCode/릿코드] 14. Longest Common Prefix (0) | 2023.01.12 |
[LeetCode/릿코드] 13. Roman to Integer (0) | 2023.01.09 |
[LeetCode/릿코드] 9. Palindrome Number (0) | 2023.01.09 |