【LeetCode】【HOT】234. 回文链表（存入数组）

【LeetCode】【HOT】234. 回文链表

package hot;

import java.util.ArrayList;
import java.util.List;

class ListNode{
    int val;
    ListNode next;

    ListNode(int val){
        this.val = val;
    }
}

public class Solution234 {
    public static void main(String[] args) {
        ListNode l1 = new ListNode(1);
        ListNode l2 = new ListNode(2);
        ListNode l3 = new ListNode(2);
        ListNode l4 = new ListNode(1);
        l1.next = l2;
        l2.next = l3;
        l3.next = l4;
        Solution234 solution = new Solution234();
        System.out.println(solution.method(l1));
    }

    private boolean method(ListNode head){
        List<Integer> vals = new ArrayList<>();
        ListNode cur = head;
        while(cur != null){
            vals.add(cur.val);
            cur = cur.next;
        }
        int left = 0;
        int right = vals.size() - 1;
        while(left < right){
            if(!vals.get(left).equals(vals.get(right))){
                return false;
            }
            left++;
            right--;
        }
        return true;
    }
}

//时间复杂度为 O(n)
//空间复杂度为 O(n)