Level 1 음양 더하기

시간 복잡도: O(N)

1#include <string>
2#include <vector>
3
4using namespace std;
5
6int solution(vector<int> absolutes, vector<bool> signs) {
7  int answer = 0;
8
9  for(int i=signs.size()-1; i>=0; --i) {
10    answer += ((signs[i]) ? absolutes[i] : absolutes[i] * -1);
11  }
12
13  return answer;
14}