【输入输出】

输入输出

//获取输入：
Scanner sc = new Scanner(System.in);
String str = sc.nextLine().toString();
String strArr[] = str.split(" ");
int data[] = new int[strArr.length];
for(int i=0; i < data.length; i++) {
	data[i] = Integer.parseInt(strArr[i]);}
//输出
System.out.println(Arrays.toString(data));
System.out.println(Arrays.deepToString(arr));

阿里巴巴编程题

 BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 String[] params = br.readLine().trim().split(" ");
 int n = Integer.parseInt(params[0]), k = Integer.parseInt(params[1]);
 int[][] fields = new int[n][k];
 for(int i = 0; i < n; i++) {
     String[] row = br.readLine().trim().split(" ");
     for (int j = 0; j < k; j++) {
         fields[i][j] = Integer.parseInt(row[j]);
     }
 }

 Scanner scanner = new Scanner(System.in);
 int n = scanner.nextInt();
 int k = scanner.nextInt();
 for (int i = 0; i < n; i++) {
     int[] a = new int[k];
     for (int j = 0; j < k; j++) {
         a[j] = scanner.nextInt();
     }
 }

遍历map

for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
	System.out.println("Key = " + entry.getKey() + ", Value = " +entry.getValue());
}
// 迭代键
for (Integer key : map.keySet()) {
	System.out.println("Key = " + key);
}
// 迭代值
for (Integer value : map.values()) {
	System.out.println("Value = " + value);
}

二维数组排序

// 先按第一列元素升序排序，如果第一列相等再按第二列元素升序；
Arrays.sort(arr, (e1,e2)->(e1[0]==e2[0]?(e1[1]-e2[1]):(e1[0]-e2[0])));

Arrays.sort(arr, new Comparator<int[]>() {    // 匿名内部类
	@Override
	public int compare(int[] e1, int[] e2) {
		// 如果第一列元素相等，则比较第二列元素
		if (e1[0]==e2[0]) return e1[1]-e2[1];   // e1[1]-e2[1]表示对于第二列元素进行升序排序
		return e1[0]-e2[0];                     // e1[0]-e2[0]表示对于第一列元素进行升序排序
	}
});