Level 1 같은 숫자는 싫어

시간 복잡도: O(N)

1#include <bits/stdc++.h>
2
3using namespace std;
4
5vector<int> solution(vector<int> arr) 
6{
7  vector<int> answer;
8  if(arr.size() == 0) return answer;
9
10  answer.push_back(arr[0]);
11
12  for(int i=1; i<arr.size(); ++i) {
13    if(answer[answer.size()-1] != arr[i]) answer.push_back(arr[i]);
14  }
15
16  return answer;
17}