Beakjoon&프로그래머스/Java
[프로그래머스/Java] 홀수 vs 짝수
현장
2025. 2. 10. 19:48
-Code
class Solution {
public int solution(int[] num_list) {
int odd = 0;
int even = 0;
for (int i = 0; i < num_list.length; i++) {
if (i % 2 == 1) odd += num_list[i]; else even += num_list[i];
}
return Math.max(odd, even);
}
}