大厂算法和数据结构刷题

package class14; import java.util.Stack; // 本题测试链接 : https://leetcode.com/problems/recover-binary-search-tree/ public class Code05_RecoverBinarySearchTree { // 不要提交这个类 public static class TreeNode { public int val; public TreeNode left; public TreeNode right; public TreeNode(int v) { val = v; } } // 如果能过leetcode，只需要提交这个方法即可 // 但其实recoverTree2才是正路，只不过leetcode没有那么考 public static void recoverTree(TreeNode root) { TreeNode[] errors = twoErrors(root); if (errors[0] != null && errors[1] != null) { int tmp = errors[0].val; errors[0].val = errors[1].val; errors[1].val = tmp; } } public static TreeNode[] twoErrors(TreeNode head) { TreeNode[] ans = new TreeNode[2]; if (head == null) { return ans; } TreeNode cur = head; TreeNode mostRight = null; TreeNode pre = null; TreeNode e1 = null; TreeNode e2 = null; while (cur != null) { mostRight = cur.left; if (mostRight != null) { while (mostRight.right != null && mostRight.right != cur) { mostRight = mostRight.right; } if (mostRight.right == null) { mostRight.right = cur; cur = cur.left; continue; } else { mostRight.right = null; } } if (pre != null && pre.val >= cur.val) { e1 = e1 == null ? pre : e1; e2 = cur; } pre = cur; cur = cur.right; } ans[0] = e1; ans[1] = e2; return ans; } // 以下的方法，提交leetcode是通过不了的，但那是因为leetcode的验证方式有问题 // 但其实！以下的方法，才是正路！在结构上彻底交换两个节点，而不是值交换 public static TreeNode recoverTree2(TreeNode head) { TreeNode[] errs = getTwoErrNodes(head); TreeNode[] parents = getTwoErrParents(head, errs[0], errs[1]); TreeNode e1 = errs[0]; TreeNode e1P = parents[0]; TreeNode e1L = e1.left; TreeNode e1R = e1.right; TreeNode e2 = errs[1]; TreeNode e2P = parents[1]; TreeNode e2L = e2.left; TreeNode e2R = e2.right; if (e1 == head) { if (e1 == e2P) { e1.left = e2L; e1.right = e2R; e2.right = e1; e2.left = e1L; } else if (e2P.left == e2) { e2P.left = e1; e2.left = e1L; e2.right = e1R; e1.left = e2L; e1.right = e2R; } else { e2P.right = e1; e2.left = e1L; e2.right = e1R; e1.left = e2L; e1.right = e2R; } head = e2; } else if (e2 == head) { if (e2 == e1P) { e2.left = e1L; e2.right = e1R; e1.left = e2; e1.right = e2R; } else if (e1P.left == e1) { e1P.left = e2; e1.left = e2L; e1.right = e2R; e2.left = e1L; e2.right = e1R; } else { e1P.right = e2; e1.left = e2L; e1.right = e2R; e2.left = e1L; e2.right = e1R; } head = e1; } else { if (e1 == e2P) { if (e1P.left == e1) { e1P.left = e2; e1.left = e2L; e1.right = e2R; e2.left = e1L; e2.right = e1; } else { e1P.right = e2; e1.left = e2L; e1.right = e2R; e2.left = e1L; e2.right = e1; } } else if (e2 == e1P) { if (e2P.left == e2) { e2P.left = e1; e2.left = e1L; e2.right = e1R; e1.left = e2; e1.right = e2R; } else { e2P.right = e1; e2.left = e1L; e2.right = e1R; e1.left = e2; e1.right = e2R; } } else { if (e1P.left == e1) { if (e2P.left == e2) { e1.left = e2L; e1.right = e2R; e2.left = e1L; e2.right = e1R; e1P.left = e2; e2P.left = e1; } else { e1.left = e2L; e1.right = e2R; e2.left = e1L; e2.right = e1R; e1P.left = e2; e2P.right = e1; } } else { if (e2P.left == e2) { e1.left = e2L; e1.right = e2R; e2.left = e1L; e2.right = e1R; e1P.right = e2; e2P.left = e1; } else { e1.left = e2L; e1.right = e2R; e2.left = e1L; e2.right = e1R; e1P.right = e2; e2P.right = e1; } } } } return head; } public static TreeNode[] getTwoErrNodes(TreeNode head) { TreeNode[] errs = new TreeNode[2]; if (head == null) { return errs; } Stack<TreeNode> stack = new Stack<TreeNode>(); TreeNode pre = null; while (!stack.isEmpty() || head != null) { if (head != null) { stack.push(head); head = head.left; } else { head = stack.pop(); if (pre != null && pre.val > head.val) { errs[0] = errs[0] == null ? pre : errs[0]; errs[1] = head; } pre = head; head = head.right; } } return errs; } public static TreeNode[] getTwoErrParents(TreeNode head, TreeNode e1, TreeNode e2) { TreeNode[] parents = new TreeNode[2]; if (head == null) { return parents; } Stack<TreeNode> stack = new Stack<TreeNode>(); while (!stack.isEmpty() || head != null) { if (head != null) { stack.push(head); head = head.left; } else { head = stack.pop(); if (head.left == e1 || head.right == e1) { parents[0] = head; } if (head.left == e2 || head.right == e2) { parents[1] = head; } head = head.right; } } return parents; } // for test -- print tree public static void printTree(TreeNode head) { System.out.println("Binary Tree:"); printInOrder(head, 0, "H", 17); System.out.println(); } public static void printInOrder(TreeNode head, int height, String to, int len) { if (head == null) { return; } printInOrder(head.right, height + 1, "v", len); String val = to + head.val + to; int lenM = val.length(); int lenL = (len - lenM) / 2; int lenR = len - lenM - lenL; val = getSpace(lenL) + val + getSpace(lenR); System.out.println(getSpace(height * len) + val); printInOrder(head.left, height + 1, "^", len); } public static String getSpace(int num) { String space = " "; StringBuffer buf = new StringBuffer(""); for (int i = 0; i < num; i++) { buf.append(space); } return buf.toString(); } // 为了测试 public static boolean isBST(TreeNode head) { if (head == null) { return false; } Stack<TreeNode> stack = new Stack<TreeNode>(); TreeNode pre = null; while (!stack.isEmpty() || head != null) { if (head != null) { stack.push(head); head = head.left; } else { head = stack.pop(); if (pre != null && pre.val > head.val) { return false; } pre = head; head = head.right; } } return true; } public static void main(String[] args) { TreeNode head = new TreeNode(5); head.left = new TreeNode(3); head.right = new TreeNode(7); head.left.left = new TreeNode(2); head.left.right = new TreeNode(4); head.right.left = new TreeNode(6); head.right.right = new TreeNode(8); head.left.left.left = new TreeNode(1); printTree(head); System.out.println(isBST(head)); System.out.println("situation 1"); TreeNode head1 = new TreeNode(7); head1.left = new TreeNode(3); head1.right = new TreeNode(5); head1.left.left = new TreeNode(2); head1.left.right = new TreeNode(4); head1.right.left = new TreeNode(6); head1.right.right = new TreeNode(8); head1.left.left.left = new TreeNode(1); printTree(head1); System.out.println(isBST(head1)); TreeNode res1 = recoverTree2(head1); printTree(res1); System.out.println(isBST(res1)); System.out.println("situation 2"); TreeNode head2 = new TreeNode(6); head2.left = new TreeNode(3); head2.right = new TreeNode(7); head2.left.left = new TreeNode(2); head2.left.right = new TreeNode(4); head2.right.left = new TreeNode(5); head2.right.right = new TreeNode(8); head2.left.left.left = new TreeNode(1); printTree(head2); System.out.println(isBST(head2)); TreeNode res2 = recoverTree2(head2); printTree(res2); System.out.println(isBST(res2)); System.out.println("situation 3"); TreeNode head3 = new TreeNode(8); head3.left = new TreeNode(3); head3.right = new TreeNode(7); head3.left.left = new TreeNode(2); head3.left