ListNode reverseLL

Light Lark answered on August 13, 2023 Popularity 3/10 Helpfulness 4/10

answer ListNode reverseLL

ListNode reverseLL

Comment

/**
 * 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 static ListNode reverseLL(ListNode head) {
 
        ListNode cur = head;
        ListNode prev = null;
        ListNode next = null;
 
        while (cur != null) {
 
            next = cur.next;
            cur.next = prev;
            prev = cur;
            cur = next;
        }
 
        return prev;
    }
 
 
    public static ListNode midPointLL (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 boolean isPalindrome(ListNode head) {
 
        ListNode midNode = midPointLL(head);
 
        ListNode temp = midNode.next;
 
        midNode.next = null;
 
        ListNode newHead = reverseLL(temp);
 
        ListNode t1 = head;
        ListNode t2 = newHead;
 
        while (t1 != null && t2 != null) {
 
            if (t1.val != t2.val)
                return false;
 
            t1 = t1.next;
            t2 = t2.next;
        }
 
 
        return true;
    }
}

Popularity 3/10 Helpfulness 4/10 Language java

Source: ideone.com

Tags: java

Link to this answer
Share Copy Link

Contributed on Aug 13 2023

Light Lark

0 Answers Avg Quality 2/10

ListNode reverseLL

Contents

More Related Answers

ListNode reverseLL

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.