#include <iostream>#include <vector>using namespace std;int solution(int n, vector<int> lost, vector<int> reserve){int answer = 0, i;int arr[32];for (i = 0; i <= n+1; i++)arr[i] = 0;for (i = 0; i < lost.size(); i++)arr[lost[i]]--;for (i = 0; i < reserve.size(); i++)arr[reserve[i]]++;for (i = 0; i < lost.size(); i++){if (arr[lost[i]] != -1)continue;if (arr[lost[i] - 1] == 1){arr[lost[i]] = 0;arr[lost[i] - 1] = 0;continue;}if (arr[lost[i] + 1] == 1){arr[lost[i]] = 0;arr[lost[i] + 1] = 0;}}for (i = 1; i <= n; i++)if (arr[i] != -1)answer++;return answer;}
'프로그래머스' 카테고리의 다른 글
[14406] 소수의 합 (0) | 2018.10.28 |
---|---|
[42840] 모의고사 (0) | 2018.10.21 |
[42588] 탑 (0) | 2018.10.20 |
[42748] K번째수 (0) | 2018.09.17 |
[42583] 주식가격 (0) | 2018.09.14 |