[알고리즘] 홀수 vs 짝수 Java

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