[BaekJoon]1650座標の位置合わせ(java)

🔗 質問リンク

👨🏻‍💻 私が作成したコード(クラスの作成と実装)

import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

class Point implements Comparable<Point>{
	int x;
	int y;
	
	public Point(int x, int y) {
		this.x = x;
		this.y = y;
	}
	
	@Override
	public int compareTo(Point o) {
		if (this.x == o.x) {
			return this.y < o.y? -1:1;
		}
		return this.x < o.x? -1:1;
	}
	
}


public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		
		int num = sc.nextInt();
		int x,y;
		
		ArrayList<Point> list = new ArrayList<>();
		
		for (int i=0; i<num; i++) {
			x = sc.nextInt();
			y = sc.nextInt();
			
			list.add(new Point(x,y));
		}
		
		Collections.sort(list);
		
		for(int i=0;i<num;i++) {
			System.out.println(list.get(i).x+" "+ list.get(i).y);
		}
	}
}

👨🏻‍💻 他者が作成したコード

package baekjoon;

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

public class Main {
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());
		StringBuilder sb = new StringBuilder();
		long[] xy = new long[N];
		long tot = 1000000;
		long check = 100000;

		for (int i = 0; i < N; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			long x = Integer.parseInt(st.nextToken()) + check;
			long y = Integer.parseInt(st.nextToken()) + check;
			xy[i] = (x * tot + y);
		}
		Arrays.sort(xy);
		for(int i=0; i<N; i++) {
			sb.append(String.valueOf((xy[i] / tot) - check) +" " + String.valueOf((xy[i] % tot) - check)).append("\n");
		}
		System.out.print(sb);
	}
}

📝 整理する

BufferedReader

StringTikenizer