[백준] 10813 공 바꾸기

https://www.acmicpc.net/problem/10813

10813번: 공 바꾸기

 

방법1

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer str = new StringTokenizer(br.readLine());

        int n = Integer.parseInt(str.nextToken());
        int m = Integer.parseInt(str.nextToken());

        int[] arr = new int[n];

        for(int i=0; i<n; i++){
            arr[i] = i+1;
        }

        for(int i=0; i<m; i++){
            StringTokenizer str1 = new StringTokenizer(br.readLine());

            int num1 = Integer.parseInt(str1.nextToken());
            int num2 = Integer.parseInt(str1.nextToken());
            int temp = 0;

            temp = arr[num1-1];
            arr[num1-1] = arr[num2-1];
            arr[num2-1] = temp;

        }
        br.close();
        for(int number : arr){
            System.out.print(number + " ");
        }
    }
}

 

방법2

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] arr = new int[n];
        for(int i=0; i<n; i++){
            arr[i] = i+1;
        }

        for(int i=0; i<m; i++){
            int temp = 0;
            int num1 = sc.nextInt();
            int num2 = sc.nextInt();

            temp = arr[num1-1];
            arr[num1-1] = arr[num2-1];
            arr[num2-1] = temp;
        }
        sc.close();
        for(int j=0; j<arr.length; j++){
            System.out.print(arr[j] + " ");
        }
    }
}