๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Algorithm

[SW Expert Academy] - (D1)2072. ํ™€์ˆ˜๋งŒ ๋”ํ•˜๊ธฐ(Stream)

by ์ฃผ๋ฐœ2 2020. 8. 5.
๋ฐ˜์‘ํ˜•

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5QSEhaA5sDFAUq&categoryId=AV5QSEhaA5sDFAUq&categoryType=CODE

 

SW Expert Academy

SW ํ”„๋กœ๊ทธ๋ž˜๋ฐ ์—ญ๋Ÿ‰ ๊ฐ•ํ™”์— ๋„์›€์ด ๋˜๋Š” ๋‹ค์–‘ํ•œ ํ•™์Šต ์ปจํ…์ธ ๋ฅผ ํ™•์ธํ•˜์„ธ์š”!

swexpertacademy.com

 

 

Q) 10๊ฐœ์˜ ์ˆ˜๋ฅผ ์ž…๋ ฅ๋ฐ›์•„ ๊ทธ ์ค‘์—์„œ ํ™€์ˆ˜๋งŒ ๋”ํ•œ ๊ฐ’์„ ์ถœ๋ ฅํ•˜๋ผ.

 

์ฝ”๋“œ

import java.util.Arrays;
import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        
        int t = scan.nextInt();
        
        for(int tc=1; tc<=t; tc++) {
            int[] arr = new int[10];
            
            for(int i=0; i<arr.length; i++) {
                arr[i] = scan.nextInt();
            }
            
            int sum = Arrays.stream(arr).filter(i -> i%2 == 1).sum();
            System.out.println("#" + tc + " " + sum);
        }
        
        scan.close();
    }

}

ํ’€์ด

Stream์˜ filter() ์ค‘๊ฐ„์—ฐ์‚ฐ์„ ํ†ตํ•ด ํ™€์ˆ˜๋ฅผ ์ถ”์ถœํ•˜๊ณ , sum() ๋ฉ”์„œ๋“œ๋ฅผ ํ†ตํ•ด ํ•ฉ์„ ๊ตฌํ•œ๋‹ค.

 

๋ฐ˜์‘ํ˜•

๋Œ“๊ธ€

๐Ÿ”HALO