LeetCode中的bug！！！！！！

1. Two Sum 

第36行本来应该是if (nodes.get(left).key < nodes.get(right).key) { 一不小心误写成了if (nodes.get(left).key < nodes.get(right).value) { 竟然A了！！！！

class Node{
    int key;
    int value;
    public Node(int key, int value) {
        this.key = key;
        this.value = value;
    }
}
public class Solution {
    /*
     * @param numbers : An array of Integer
     * @param target : target = numbers[index1] + numbers[index2]
     * @return : [index1 + 1, index2 + 1] (index1 < index2)
     */
    public int[] twoSum(int[] numbers, int target) {
        if (numbers == null || numbers.length <= 1) {
            return new int [2];
        }
        //put the key and value in list, the type of list is Node
        List<Node> nodes = new ArrayList<>();
        for (int i = 0; i < numbers.length; i++) {
            nodes.add(new Node(i, numbers[i]));
        }
        //sort the list
        Collections.sort(nodes, new Comparator<Node>() {
            public int compare(Node a, Node b) {
                return a.value - b.value;
            }
        });
        // Two points
        int left = 0;
        int right = numbers.length - 1;
        int[] result = new int[2];
        while (left < right) {
            if (nodes.get(left).value + nodes.get(right).value == target) {
                if (nodes.get(left).key < nodes.get(right).value) { //第二个明显应该是key,但是第一次不小心写成了value，居然A了，但是lintcode却不能A
                    result[0] = nodes.get(left).key;
                    result[1] = nodes.get(right).key;
                } else {
                    result[0] = nodes.get(right).key;
                    result[1] = nodes.get(left).key;
                }
                return result;
            } else if (nodes.get(left).value + nodes.get(right).value < target) {
                left++;
            } else {
                right--;
            }
        }
        return result;
    }
}

 572. Subtree of Another Tree 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isSubtree(TreeNode root1, TreeNode root2) {
        //如果root2不进行判断，也A了，但是很明显这样是错的
        //这样的话并没有考虑，两个都为空，以及root1不为空，而root2为空的情况
        if (root2 == null) {
            return true;
        }    
        if (root1 == null) {
            return false;
        }
        if(isEqual(root1, root2)) {
            return true;
        }
        return isSubtree(root1.left, root2) || isSubtree(root1.right, root2);
    }
    public boolean isEqual(TreeNode root1, TreeNode root2) {
        if (root1 == null || root2 == null) {
            return root1 == root2;
        }
        if (root1.val != root2.val) {
            return false;
        }
        return isEqual(root1.left, root2.left) && isEqual(root1.right, root2.right);
    }
}