剑指offer个人答案(Java版)-4

最新推荐文章于 2025-03-31 12:52:59 发布

Ymq.

最新推荐文章于 2025-03-31 12:52:59 发布

阅读量210

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/qq_38556217/article/details/118271859

版权

本文详细解析了四道经典算法题目：链表的反转、两个排序链表的合并、判断一棵树是否为另一棵树的子结构及二叉树的镜像操作。每道题目都附带了详细的代码实现，帮助读者更好地理解和掌握这些核心算法。

摘要由CSDN通过智能技术生成

文章目录

24. 反转链表

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode prev = null, curr = head;
        while (curr != null) {
            ListNode next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
}

25. 合并两个排序的链表

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
          ListNode data = new ListNode(0), cur = data;
         while (l1!=null && l2 != null) {
             if (l1.val < l2.val) {
                 cur.next = l1;
                 l1 = l1.next;
             }
             else {
                cur.next = l2;
                l2 = l2.next;
             }
             cur = cur.next;
         }
         cur.next = l1 != null ? l1:l2;
         return data.next;
    }
}

26. 树的子结构

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
     public boolean DoesTreeHaveTree(TreeNode A, TreeNode B) {
        if (B == null) return true;
        if (A == null) return false;
        if (A.val != B.val) return false;
        return DoesTreeHaveTree(A.left, B.left) &&
                DoesTreeHaveTree(A.right, B.right);
    }

    public boolean isSubStructure(TreeNode A, TreeNode B) {
        boolean result = false;
        if (A != null && B != null) {
            //
            if (A.val == B.val) result =  DoesTreeHaveTree(A, B);
            if (!result) result = isSubStructure(A.left, B);
            if (!result) result = isSubStructure(A.right, B);
        }
        return result;
    }
}

27. 二叉树的镜像

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {

    public TreeNode mirrorTree(TreeNode root) {
        if (root == null) return null;
        TreeNode node = root.right;
        root.right = mirrorTree(root.left);
        root.left = mirrorTree(node);
        return root;  
    }
}