https://school.programmers.co.kr/learn/courses/30/lessons/76501
삼항 연산자로 깔끔하게 풀었다
import java.util.*;
class Solution {
public int solution(int[] absolutes, boolean[] signs) {
int sum =0;
for(int i=0; i<absolutes.length; i++){
sum += signs[i] ? absolutes[i] : -1 * absolutes[i];
}
return sum;
}
}