Leetcode(6) - easy

7.Reverse Integer My Submissions Question
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
求解如下：

public class Solution {
    public int reverse(int x) {
        //精度上并没有太为难
        long result = 0;
        while (x!=0) {

            result = result * 10 + x % 10;
            x /= 10;
        }
        //三目运算符，用好了有奇效
        //Integer.MAX_VALUE(C++)越界判断
        return (result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) ? 0 : (int)result;
    }
}

19.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.
(n will always be valid)
求解如下：
从尾部计算的链表一般都可以使用双指针求解
此处需要注意删除的是头或尾结点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        if (head == NULL)
            return NULL;
        ListNode* p = head;
        ListNode* q = head;
        ListNode* pr= NULL;
        //双指针相差n-1,并共同移动
        for(int i=0; i<n-1;i++){
            q=q->next;
        }
        while(q->next){
            pr = p;
            p = p->next;
            q = q->next;
        }
        if(pr!=NULL)
            pr->next = p->next;
        //若删除头结点或尾结点
        else
            head= p->next;
        delete p;   
        return head;
    }
};