小米 树高度

我的复杂算法：

package mi;

import java.io.BufferedInputStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class T3 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(new BufferedInputStream(System.in));
		int n = scanner.nextInt();
		if (n <= 0)
			System.out.println(0);
		else if (n == 1)
			System.out.println(1);
		else {
			List<Node> list = new ArrayList<>();
			for (int i = 0; i < n; i++) {
				Node node = new Node(i);
				list.add(node);
			}
			int[][] no = new int[n][2];
			for (int i = 0; i < n - 1; i++) {
				no[i][0] = scanner.nextInt();
				no[i][1] = scanner.nextInt();
				if (list.get(no[i][0]).left == null) {
					list.get(no[i][0]).left = list.get(no[i][1]);
				} else
					list.get(no[i][0]).right = list.get(no[i][1]);
			}
			int[] tmp = new int[n];
			for (int i = 0; i < n; i++) {
				tmp[no[i][1]] = 1;
			}
			int root = 0;
			for (int i = 0; i < n; i++) {
				if (tmp[i] == 0) {
					root = i;
					break;
				}
			}
			System.out.println(findRoot(list.get(root), 1));
		}
	}

	public static int findRoot(Node node, int h) {
		if (node.right == null && node.left == null)
			return h;
		else if (node.right == null) {
			return findRoot(node.left, h + 1);
		} else if (node.left == null)
			return findRoot(node.right, h + 1);
		return findRoot(node.left, h + 1) > findRoot(node.right, h + 1) ? findRoot(node.left, h + 1)
				: findRoot(node.right, h + 1);
	}
}

class Node {
	int val = 0;
	Node left = null, right = null;

	public Node(int val) {
		this.val = val;
	}
}

看到的别人简单方法（其实以前会这种算法，好长时间没用，忘了。叫并查集）：

package mi;

import java.util.Scanner;

public class tmp {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while (in.hasNext()) {
			int n = in.nextInt();
			int[] tree = new int[n];
			for (int i = 0; i < tree.length; i++) {
				tree[i] = -1;
			}
			for (int i = 0; i < n - 1; i++) {
				int p = in.nextInt();
				int c = in.nextInt();
				tree[c] = p;
			}
			int max = 1;
			int count = 0;
			for (int i = n - 1; i > 0; --i) {
				int cur = i;
				while (cur != -1) {
					cur = tree[cur];
					count++;
				}
				if (count > max)
					max = count;
				count = 0;
			}
			System.out.println(max);
		}
	}
}