Search

์ตœ๋Œ“๊ฐ’ ๊ตฌํ•˜๊ธฐ

package Day04; import java.util.Scanner; public class Ex02_Max { public static void main(String[] args) { // ์ฒซ ๋ฒˆ์งธ ์ค„์— ์ž…๋ ฅํ•  ๊ฐœ์ˆ˜ N์„ ์ž…๋ ฅ๋ฐ›๊ณ , // ๋‘˜์งธ ์ค„์— N๊ฐœ์˜ ์ •์ˆ˜๋ฅผ ๊ณต๋ฐฑ์„ ๋‘๊ณ  ์ž…๋ ฅ๋ฐ›์œผ์‹œ์˜ค. // N ๊ฐœ์˜ ์ •์ˆ˜ ์ค‘, ์ตœ๋Œ“๊ฐ’์„ ๊ตฌํ•˜์‹œ์˜ค. // (์ž…๋ ฅ์˜ˆ์‹œ) // 5 // 90 60 70 100 55 // (์ถœ๋ ฅ) // ์ตœ๋Œ“๊ฐ’ : 100 /* (์ˆœ์„œ๋„) 1. ์ •์ˆ˜ ํ•˜๋‚˜ ์ž…๋ ฅ๋ฐ›์•„์„œ N์— ๋Œ€์ž… 2. N๊ฐœ ์š”์†Œ๋ฅผ ๊ฐ–๋Š” ๋ฐฐ์—ด ์„ ์–ธ ๋ฐ ์ƒ์„ฑ 3. N๋ฒˆ ๋งŒํผ N๊ฐœ์˜ ์ •์ˆ˜ ์ž…๋ ฅ๋ฐ›์•„์„œ ๋ฐฐ์—ด arr ๋Œ€์ž… 4. ๋ฐฐ์—ด์„ ๋ฐ˜๋ณตํ•ด์„œ ์ตœ๋Œ“๊ฐ’ max ๋ฐฐ์—ด์˜ i๋ฒˆ์งธ ์š”์†Œ์™€ ๋น„๊ต 5. ๋‘ ์š”์†Œ ์ค‘์—์„œ ๋” ํฐ ์š”์†Œ๋ฅผ max์— ๋Œ€์ž… 6. ๋ฐ˜๋ณต ๋๋‚˜๊ณ , max ๋ฅผ ์ถœ๋ ฅ */ Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int arr[] = new int[N]; for (int i = 0; i < arr.length; i++) { arr[i] = sc.nextInt(); } // Integer.MIN_VALUE : -21์–ตxxx : int ์˜ ์ตœ์†Ÿ๊ฐ’ int max = Integer.MIN_VALUE; for (int i = 0; i < arr.length; i++) { if( max < arr[i] ) { max = arr[i]; } } System.out.println("์ตœ๋Œ“๊ฐ’ : " + max); sc.close(); } }
Java
๋ณต์‚ฌ