๐ŸŒท๐ŸŒผ๋ชจ์—ฌ๋ด์š” ๊ฐœ๋ฐœ์˜์ˆฒ๐ŸŒท๐ŸŒผ

[JAVA/์ฝ”๋”ฉํ…Œ์ŠคํŠธ] ๋ณด์ด๋Š” ํ•™์ƒ ๋ณธ๋ฌธ

๊ฐœ๋ฐœ/์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œํ’€์ด JAVA

[JAVA/์ฝ”๋”ฉํ…Œ์ŠคํŠธ] ๋ณด์ด๋Š” ํ•™์ƒ

์š”์ผ์ด 2021. 4. 24. 18:14
๋ฐ˜์‘ํ˜•

๋ฌธ์ œ

import java.util.*;
import java.io.*;

public class Main {
	
	public void solution(int num, int[] array) {
		
		int count = 0;
		int max = 0;
		for(int i=0; i<num; i++) {
        	// ์ตœ๋Œ€ ์ˆ˜ ๋ณด๋‹ค ํฌ๋‹ค๋ฉด
			if(max < array[i]) {
			    max = array[i];
				count ++;
			}
		}
		
		 System.out.print(count);

	}

	public static void main(String args[]) {
        Main main = new Main();
		// ๋ฌธ์ž๋ฅผ ์ž…๋ ฅ๋ฐ›๋Š”๋‹ค
		Scanner in= new Scanner(System.in);
        // ์ฒซ์ค„ ์ž…๋ ฅ
		int num = in.nextInt();
        // ๋ฐฐ์—ด ์ƒ์„ฑ
		int[] array = new int[num+1];
		// ๋ฐฐ์—ด์— ์ˆซ์ž ์ž…๋ ฅ
        for(int i=0; i<num; i++) {
			array[i] = in.nextInt();
		}
		
		main.solution(num, array); 
	}

}
Comments