[Programmers] Lv.0 / 커피 심부름 / Java

문제

 

풀이

import java.util.Arrays;

class Solution {
    public int solution(String[] order) {
        return Arrays.stream(order)
            .mapToInt(x -> x.contains("cafelatte") ? 5000 : 4500)
            .sum();
    }
}

class Solution {
    public int solution(String[] order) {
        int answer = 0;
        for(String str : order) {
            if(str.contains("cafelatte")) {
                answer += 5000;
            } else {
                answer += 4500;
            }
        }
        return answer;
    }
}

 

출처

https://school.programmers.co.kr/learn/courses/30/lessons/181837