@@ -0,0 +1,14 @@
+import java.util.Arrays;
+
+/**
+* @Author: iqqcode
+* @Date: 2020-10-19 09:55
+* @Description:
+*/
+public class Main {
+public static void main(String[] args) {
+int[][] arr = {{1, 3, 2}, {9, 20, 5}, {8, 9}};
+Arrays.stream(arr);
+int i = 0;
+}
+}

@@ -0,0 +1,51 @@
+package xunlei;
+
+/**
+* @Author: iqqcode
+* @Date: 2020-10-19 18:52
+* @Description:迅雷笔试
+*/
+
+import java.util.*;
+
+public class Solution {
+static List<String> list = new ArrayList<>();
+
+public static void main(String[] args) {
+Scanner in = new Scanner(System.in);
+int n = in.nextInt();
+in.nextLine();
+String[][] nodes = new String[4][2];
+Set<String> set = new HashSet<>();
+String a = null, b = null;
+for (int i = 0; i < n; i++) {
+a = nodes[i][0] = in.next();
+b = nodes[i][1] = in.next();
+set.add(a);
+set.add(b);
+}
+
+//拿到头结点
+for (int i = 0; i < nodes.length; i++) {
+if (set.contains(nodes[i][1])) {
+set.remove(nodes[i][1]);
+}
+}
+//获取集合的第一个元素
+String head = set.iterator().next();
+list.add(head);
+listRefactor(nodes, head);
+for (int i = 0; i < list.size(); i++) {
+System.out.println(list.get(i));
+}
+}
+
+private static void listRefactor(String[][] nodes, String head) {
+for (int i = 0; i < nodes.length; i++) {
+if (nodes[i][0].equals(head)) {
+list.add(nodes[i][1]);
+listRefactor(nodes, nodes[i][1]);
+}
+}
+}
+}

@@ -0,0 +1,72 @@
+package xunlei;
+
+/**
+* @Author: iqqcode
+* @Date: 2020-10-19 18:52
+* @Description:迅雷笔试-2 杨氏矩阵元素由小到大有序输出
+* [case]:
+* 4 3 // 4行3列
+* 1 2 3
+* 2 3 4
+* 4 5 6
+* 6 7 8
+*/
+
+import java.util.*;
+
+public class Solution2 {
+public static void main(String[] args) {
+Scanner in = new Scanner(System.in);
+int m = in.nextInt();
+int n = in.nextInt();
+in.nextLine();
+int[][] arr = new int[m][n];
+for (int i = 0; i < m; i++) {
+for (int j = 0; j < n; j++) {
+arr[i][j] = in.nextInt();
+}
+}
+youngExtract(arr);
+}
+
+public static void youngExtract(int[][] arr) {
+int min = 0;
+for (int i = arr.length - 1; i >= 0; i--) {
+for (int j = arr[0].length - 1; j >= 0; j--) {
+min = arr[0][0];
+if (min != Integer.MAX_VALUE) {
+System.out.println(min);
+}
+arr[0][0] = arr[i][j];
+arr[i][j] = Integer.MAX_VALUE;
+youngHeapify(arr, 0, 0);
+}
+}
+}
+
+
+public static void youngHeapify(int[][] arr, int row, int col) {
+int N = arr.length;
+int M = arr[0].length;
+int min_i = row;
+int min_j = col;
+if (min_j < M - 1 && arr[row][col + 1] != Integer.MAX_VALUE && arr[min_i][min_j] > arr[row][col + 1]) {
+min_i = row;
+min_j = col + 1;
+}
+
+if (min_i < N - 1 && arr[row + 1][col] != Integer.MAX_VALUE && arr[min_i][min_j] > arr[row + 1][col]) {
+min_i = row + 1;
+min_j = col;
+}
+
+if (min_i != row || min_j != col) {
+int tmp = arr[min_i][min_j];
+arr[min_i][min_j] = arr[row][col];
+arr[row][col] = tmp;
+youngHeapify(arr, min_i, min_j);
+}
+}
+}
+
+