GiantStepDEV
article thumbnail
์ •์ˆ˜ ๊ฐ’ ์ž…๋ ฅ
์ž…๋ ฅ๋œ ์ •์ˆ˜ ๋ฒ”์œ„์˜ ์ž„์˜์˜ ๊ฐ’ ์ž…๋ ฅํ•ด์„œ ๋ฐฐ์—ด ์ƒ์„ฑ
ํ•ด๋‹น ๋ฐฐ์—ด์—์„œ ์ œ์ผ ์ž‘์€ ๊ฐ’๊ณผ ์ œ์ผ ํฐ ๊ฐ’ ์ฐพ๊ธฐ
(์ถœ๋ ฅํ™”๋ฉด)
์ •์ˆ˜ ๊ฐ’ ์ž…๋ ฅ : 10
1 3 8 79 5 42 14 5 8 7 30
MIN : 1
MAX : 79
package ๋ฐฐ์—ด๋ณต์Šต;
import java.util.Scanner;

public class ArrReview {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("๊ฐฏ์ˆ˜ ์ž…๋ ฅ : ");
        int value = sc.nextInt();
        int[] valueNum = new int[value];
        for(int i=0; i<valueNum.length; i++) {
            System.out.print("์ •์ˆ˜ ๊ฐ’ ์ž…๋ ฅ : ");
            valueNum[i] = sc.nextInt();
        }
        int min = valueNum[0];
        int max = valueNum[0];

        for(Integer e : valueNum) {
            if(e < min) min = e;
            if(e > max) max = e;
        }
        System.out.printf("MIN : %d, MAX : %d\n",min,max);
    }
}

profile

GiantStepDEV

@kongmi

ํฌ์ŠคํŒ…์ด ์ข‹์•˜๋‹ค๋ฉด "์ข‹์•„์š”โค๏ธ" ๋˜๋Š” "๊ตฌ๋…๐Ÿ‘๐Ÿป" ํ•ด์ฃผ์„ธ์š”!