QihaoD的专栏

Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists:  A: a1 → a2 ↘

Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time and O(1) space? public class Solution { ListNode h; public boolean isPalindrome(ListNo