题目

题目链接.


输入：

5
td1336065617 1336065617 n 13766949653
1336065617 1336065617 nc 137
ad1336065617 1336065617 na 111
03360651778 1 9 8
1 1 1 1

输出：

1 1 1 1
1336065617 1336065617 nc 137
03360651778 1 9 8
ad1336065617 1336065617 na 111
td1336065617 1336065617 n 13766949653

分析：

获取每一行数据为一个元组，通过CMP函数排序。

排序方式为预处理CMP：返回值大于0即交换位置

	//返回值大于0即交换位置
	static class mycmp implements Comparator<Node>{
    
    
		public int compare(Node A, Node B){
    
    
			if (A.s.length() - B.s.length() != 0)
				return A.s.length() - B.s.length();
			else
				return A.s.compareTo(B.s);
		}
	}

然后用排序函数调用

Arrays.sort(arr, 0, n, new mycmp());

AC代码：

import java.util.*;
public class Main {
    
    
	static class mycmp implements Comparator<Node>{
    
    
		public int compare(Node A, Node B){
    
    
			if (A.s.length() - B.s.length() != 0)
				return A.s.length() - B.s.length();
			else
				return A.s.compareTo(B.s);
		}
	}

	public static void main(String[] args) {
    
    
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		Node arr[] = new Node[n];
		for (int i = 0; i < n; i++) {
    
    
			arr[i] = new Node(sc.next(), sc.next(), sc.next(), sc.next());
		}
		Arrays.sort(arr, 0, n, new mycmp());
		for (int i = 0; i < n; i++) {
    
    
			System.out.println(arr[i].s + " " + arr[i].m + " " + arr[i].x + " " + arr[i].h);
		}
	}

	static class Node {
    
    
		String s, m, x, h;

		Node(String s, String m, String x, String h) {
    
    
			this.s = s;
			this.m = m;
			this.x = x;
			this.h = h;
		}
	}
}