个人记录-LeetCode 99. Recover Binary Search Tree

问题:
Two elements of a binary search tree (BST) are swapped by mistake.

Recover the tree without changing its structure.

Note:
A solution using O(n) space is pretty straight forward. Could you devise a constant space solution?

这个问题场景是:
二叉搜索树中,节点的值存在问题,在不改变树结构的前提下,修复该二叉搜索树。


代码示例:
1、O(n) space的解法
这种解法比较简单,主要的依据是:
正常的二叉搜素树,按照中序遍历后,
节点的值应该是按照从小到大的顺序排列的。

按照这种思路,可以得到如下的解法:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public void recoverTree(TreeNode root) {
        List<TreeNode> nodeList = new ArrayList<>();

        //先中序遍历
        inOrder(root, nodeList);

        //得到当前的节点值
        int[] values = new int[nodeList.size()];
        for (int i = 0; i < nodeList.size(); ++i) {
            values[i] = nodeList.get(i).val;
        }

        //重新排序
        Arrays.sort(values);

        //将排序后的值赋给节点
        for (int i = 0; i < nodeList.size(); ++i) {
            nodeList.get(i).val = values[i];
        }
    }

    //中序排序主要就用到了递归
    //先左子树;然后中间节点;再右子树即可
    private void inOrder(TreeNode root, List<TreeNode> rst) {
        if (root == null) {
            return;
        }

        inOrder(root.left, rst);

        rst.add(root);

        inOrder(root.right, rst);
    }
}

2、上述方法的改进
实际上在中序遍历时,我们并不需要记录所有节点的信息,
仅保留出现问题的节点即可。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    //prev记录遍历的前一个节点
    //first记录出现问题的第一个节点
    //second记录出现问题的第二个节点
    TreeNode prev, first, second;

    public void recoverTree(TreeNode root) {
        //依然中序遍历节点
        inOrder(root);

        //如果找到出现问题的两个节点,则交换这两个节点的值
        if (first != null && second != null) {
            int tmp = first.val;
            first.val = second.val;
            second.val = tmp;
        }
    }

    private void inOrder(TreeNode root) {
        if (root == null) {
            return;
        }

        inOrder(root.left);


        if (prev != null) {
            //前一个节点的值大于当前节点
            //说明出现问题
            if (prev.val > root.val) {

                //如果第一次遇到这种情况,那么第一个出错的节点就是当前的prev
                if (first == null) {
                    first = prev;
                }

                //第一次时,第二个节点记录为root
                //即假设出错的两个节点“紧挨着”

                //若第二次重新进入该分支
                //则出错的两个节点有“距离”,此时第二出错节点为当前的root
                second = root;
            }
        }

        //prev永远记录前一个节点
        prev = root;

        inOrder(root.right);
    }
}
1. Two Sum 2. Add Two Numbers 3. Longest Substring Without Repeating Characters 4. Median of Two Sorted Arrays 5. Longest Palindromic Substring 6. ZigZag Conversion 7. Reverse Integer 8. String to Integer (atoi) 9. Palindrome Number 10. Regular Expression Matching 11. Container With Most Water 12. Integer to Roman 13. Roman to Integer 14. Longest Common Prefix 15. 3Sum 16. 3Sum Closest 17. Letter Combinations of a Phone Number 18. 4Sum 19. Remove Nth Node From End of List 20. Valid Parentheses 21. Merge Two Sorted Lists 22. Generate Parentheses 23. Swap Nodes in Pairs 24. Reverse Nodes in k-Group 25. Remove Duplicates from Sorted Array 26. Remove Element 27. Implement strStr() 28. Divide Two Integers 29. Substring with Concatenation of All Words 30. Next Permutation 31. Longest Valid Parentheses 32. Search in Rotated Sorted Array 33. Search for a Range 34. Find First and Last Position of Element in Sorted Array 35. Valid Sudoku 36. Sudoku Solver 37. Count and Say 38. Combination Sum 39. Combination Sum II 40. First Missing Positive 41. Trapping Rain Water 42. Jump Game 43. Merge Intervals 44. Insert Interval 45. Unique Paths 46. Minimum Path Sum 47. Climbing Stairs 48. Permutations 49. Permutations II 50. Rotate Image 51. Group Anagrams 52. Pow(x, n) 53. Maximum Subarray 54. Spiral Matrix 55. Jump Game II 56. Merge k Sorted Lists 57. Insertion Sort List 58. Sort List 59. Largest Rectangle in Histogram 60. Valid Number 61. Word Search 62. Minimum Window Substring 63. Unique Binary Search Trees 64. Unique Binary Search Trees II 65. Interleaving String 66. Maximum Product Subarray 67. Binary Tree Inorder Traversal 68. Binary Tree Preorder Traversal 69. Binary Tree Postorder Traversal 70. Flatten Binary Tree to Linked List 71. Construct Binary Tree from Preorder and Inorder Traversal 72. Construct Binary Tree from Inorder and Postorder Traversal 73. Binary Tree Level Order Traversal 74. Binary Tree Zigzag Level Order Traversal 75. Convert Sorted Array to Binary Search Tree 76. Convert Sorted List to Binary Search Tree 77. Recover Binary Search Tree 78. Sum Root to Leaf Numbers 79. Path Sum 80. Path Sum II 81. Binary Tree Maximum Path Sum 82. Populating Next Right Pointers in Each Node 83. Populating Next Right Pointers in Each Node II 84. Reverse Linked List 85. Reverse Linked List II 86. Partition List 87. Rotate List 88. Remove Duplicates from Sorted List 89. Remove Duplicates from Sorted List II 90. Intersection of Two Linked Lists 91. Linked List Cycle 92. Linked List Cycle II 93. Reorder List 94. Binary Tree Upside Down 95. Binary Tree Right Side View 96. Palindrome Linked List 97. Convert Binary Search Tree to Sorted Doubly Linked List 98. Lowest Common Ancestor of a Binary Tree 99. Lowest Common Ancestor of a Binary Search Tree 100. Binary Tree Level Order Traversal II
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值