[알고리즘문제풀기] 커피 심부름

문제

내가 작성한 정답

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

List

import java.util.*;

class Solution {
    public int solution(String[] order) {
        int answer = 0;
        List<String> p5000 = Arrays.asList("icecafelatte", "cafelatteice","hotcafelatte", "cafelattehot","cafelatte");
        List<String> p4500 = Arrays.asList("iceamericano", "americanoice","hotamericano", "americanohot","americano","anything");
        for(String s:order){
            answer += p4500.contains(s)? 4500 : 0;
            answer += p5000.contains(s)? 5000 : 0;
        }
        return answer;
    }
}