Two pointers (6) -- Palindrome Linked List, Remove Nth Node From End of List

Palindrome Linked List

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?

1. 找到中点；反转后半部分；比较前半部分和后半部分

   bool isPalindrome(ListNode* head) {
        if(head == NULL || head->next == NULL)
            return true;
        ListNode* slow=head;
        ListNode* fast=head;
        while(fast->next!=NULL && fast->next->next != NULL){ //找到中点
            slow = slow->next;
            fast = fast->next->next;
        }
        slow->next = reverseList(slow->next);
        slow = slow->next;
        while(slow != NULL){ //判断是否回文
            if(head->val != slow->val)
                return false;
            head = head->next;
            slow = slow->next;
        }
        return true;
    }
    //反转链表
    ListNode* reverseList(ListNode* head) {
        ListNode* pre = NULL;
        ListNode* next = NULL;
        while(head != NULL){
            next = head->next;
            head->next = pre;
            pre = head;
            head = next;
        }
        return pre; //返回反转之后的链表头部
    }

Implement strStr()

Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

1. 双指针遍历过去。

2. 此题也可以用KMP算法

    int strStr(string haystack, string needle) {
        int m = haystack.length(), n = needle.length();
        if (!n) return 0;
        for (int i = 0; i < m - n + 1; i++) {
            int j = 0;
            for (; j < n; j++)
                if (haystack[i + j] != needle[j])
                    break;
            if (j == n) return i;
        }
        return -1;
    }

Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head.

For example,

   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:
Given n will always be valid.
Try to do this in one pass.

双指针，使得两个指针相距为n

    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode* t1 = head, *t2 = head;  
        for(int i = 0; i < n; ++i)
        {
            t2 = t2->next;
        }

	if (t2 == NULL) return head->next; //头结点被删除
        while(t2->next != NULL)
        {
            t1 = t1->next;
            t2 = t2->next;
        }
        t1->next = t1->next->next;
        return head;
    }