[백준/java] 2752 세 수 정렬

 

 

<내 코드>

package Baekjoon;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int[] numbers=new int[3];
        for (int i=0;i<3;i++){
            numbers[i]=sc.nextInt();
        }
        for (int i=0;i<2;i++){
            for(int j=0;j<2-i;j++)
                if(numbers[j]>numbers[j+1]){
                    int max=numbers[j];
                    numbers[j]=numbers[j+1];
                    numbers[j+1]=max;
                }

        }
        for (int i=0;i<3;i++){
            System.out.print(numbers[i]+" ");
        }



    }
}

ㅠ_ㅠ