[Programmers] Lv.0 / 홀수 vs 짝수 / Java

문제

 

풀이

class Solution {
    public int solution(int[] num_list) {
        int evenSum = 0;
        int oddSum = 0;
        
        for(int i = 0; i < num_list.length; i++) {
            if(i % 2 == 0) {
                evenSum += num_list[i];
            } else {
                oddSum += num_list[i];
            }
        }
        return evenSum >= oddSum ? evenSum : oddSum;
    }
}

class Solution {
    public int solution(int[] num_list) {
        int evenSum = 0;
        int oddSum = 0;
        
        for(int i = 0; i < num_list.length; i++) {
            if(i % 2 == 0) {
                evenSum += num_list[i];
            } else {
                oddSum += num_list[i];
            }
        }
        return Math.max(evenSum, oddSum);
    }
}

 

출처

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