def solution(arr):
answer = []
count = 0
answer.append(arr[0])
for i in arr:
if answer[count] != i:
answer.append(i)
count+=1
return answer
def solution(arr):
answer = []
for i in arr:
if answer[-1:] == [i]: continue
answer.append(i)
return answer
바꾼게 코드는 좀더 짧으나 효율성은 떨어졌다.
import java.util.*;
public class Solution {
public int[] solution(int []arr) {
int[] answer ;
int count = 1;
for(int i=1; i<arr.length; i++){
if(arr[i-1] != arr[i])
count++;
}
answer = new int[count];
count=1;
answer[0] = arr[0];
for(int i=1; i<arr.length; i++){
if(arr[i-1] != arr[i]){
answer[count] = arr[i];
count++;
}
}
return answer;
}
}