Leetcode刷题计划Day15-CSDN博客

本文链接：https://blog.csdn.net/wREN_GHOST/article/details/124311742

文章目录

101. 对称二叉树【简单】

https://leetcode-cn.com/problems/symmetric-tree/

234. 回文链表【简单】

https://leetcode-cn.com/problems/palindrome-linked-list/

/**
 * Definition for singly-linked list. * public class ListNode { *     int val; *     ListNode next; *     ListNode() {} *     ListNode(int val) { this.val = val; } *     ListNode(int val, ListNode next) { this.val = val; this.next = next; } * } */class Solution {    public boolean isPalindrome(ListNode head) {        if (head == null || head.next == null) return true;        ListNode A_end = Findmid(head);        ListNode B_start = A_end.next;        A_end.next = null;        B_start = reverse(B_start);        boolean res = compare(head, B_start);        //A_end.next = reverse(B_start);        return res;    }    public ListNode Findmid(ListNode head) {        ListNode slow = head;        ListNode fast = head;        while (fast.next != null && fast.next.next != null) {            slow = slow.next;            fast = fast.next.next;        }        return slow;    }    public ListNode reverse (ListNode head) {        ListNode pre = null;        ListNode cur = head;        while (cur != null) {            ListNode temp = cur.next;            cur.next = pre;            pre = cur;            cur = temp;        }        return pre;    }    public boolean compare (ListNode headA, ListNode headB) {        while (headB != null) {            if (headA.val != headB.val)                return false;            headA = headA.next;            headB = headB.next;        }        return true;    }}