04-29 19:24
Recent Posts
Recent Comments
๊ด€๋ฆฌ ๋ฉ”๋‰ด

miinsun

[Algorithm]์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ž๋ฐ”_13 ํฐ ์ˆ˜ ์ถœ๋ ฅํ•˜๊ธฐ ๋ณธ๋ฌธ

Algorithm/Java

[Algorithm]์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ž๋ฐ”_13 ํฐ ์ˆ˜ ์ถœ๋ ฅํ•˜๊ธฐ

miinsun 2022. 1. 3. 12:32

 

๐Ÿ’ฌ ๋ฌธ์ œ ์„ค๋ช…

N๊ฐœ์˜ ์ •์ˆ˜๋ฅผ ์ž…๋ ฅ๋ฐ›์•„, ์ž์‹ ์˜ ๋ฐ”๋กœ ์•ž ์ˆ˜๋ณด๋‹ค ํฐ ์ˆ˜๋งŒ ์ถœ๋ ฅํ•˜๋Š” ํ”„๋กœ๊ทธ๋žจ์„ ์ž‘์„ฑํ•˜์„ธ์š”.
(์ฒซ ๋ฒˆ์งธ ์ˆ˜๋Š” ๋ฌด์กฐ๊ฑด ์ถœ๋ ฅํ•œ๋‹ค)

 

 

 

๐Ÿ”จ ์ž…์ถœ๋ ฅ ์˜ˆ

์ž…๋ ฅ - ์ฒซ ์ค„์— ์ž์—ฐ์ˆ˜ N(1<=N<=100)์ด ์ฃผ์–ด์ง€๊ณ , ๊ทธ ๋‹ค์Œ ์ค„์— N๊ฐœ์˜ ์ •์ˆ˜๊ฐ€ ์ž…๋ ฅ๋œ๋‹ค.

6
7 3 9 5 6 12

์ถœ๋ ฅ - ์ž์‹ ์˜ ๋ฐ”๋กœ ์•ž ์ˆ˜๋ณด๋‹ค ํฐ ์ˆ˜๋งŒ ํ•œ ์ค„๋กœ ์ถœ๋ ฅํ•œ๋‹ค.

7 9 6 12

 

 

โ€‹

๐Ÿ’ป Solution.java

import java.util.Scanner;
  
public class Main {
	public void solution(int[] arr) {
		for(int i = 1; i < arr.length; i ++) {
			if(arr[i] > arr[i - 1])
				System.out.print(arr[i] + " ");
			
		}
	}
	
	public static void main(String[] args){
		Main main  = new Main();
		Scanner sc =new Scanner(System.in);
		int size = sc.nextInt();
		int[] arr = new int[size + 1];
		
		for(int i = 1; i <= size; i++)
			arr[i] = sc.nextInt();
		
		main.solution(arr);
		
		sc.close();
		return ;
	}
}

 

 

 

Comments