Leetcode Day10

70. 爬楼梯【简单】

https://leetcode-cn.com/problems/climbing-stairs/

class Solution {
public:
    int climbStairs(int n) {
        vector<int>dp(n+1, 0);
        dp[1] = 1;
        dp[0] = 1;
        for(int i=2; i<=n; i++)
        {
            dp[i] = dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
};

剑指 Offer 22. 链表中倒数第k个节点【简单】
https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* getKthFromEnd(ListNode* head, int k) {
        ListNode* fast = head;
        ListNode* slow = head;
        while(fast)
        {
            if(k)
            {
                k--;
                fast = fast->next;
                continue;
            }
            slow = slow->next;
            fast = fast->next;
        }
        return slow;
    }
};

19. 删除链表的倒数第 N 个结点【中等】

https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode* dummy = new ListNode(-1);
        dummy->next = head;
        ListNode* right = dummy;
        ListNode* left = dummy;
        if(head==nullptr)
            return head;
        int cnt=0;
        while(cnt++<n)
        {
            right = right->next;
        }
        while(right->next!=nullptr)
        {
            right = right->next;
            left = left->next;
        }
        left->next = left->next->next;
        return dummy->next;
    }
};

69. x 的平方根【简单】

https://leetcode-cn.com/problems/sqrtx/

class Solution {
public:
    int mySqrt(int x) {
        if(x==0) return 0;
        int l=1; int r=x;
        while(l<r)
        {
            int mid = l+(r-l)/2;
            if (x/mid<=mid)
                r=mid;
            else l=mid+1;
        }
        if((double)x/l<l)
            l--;
        return l;
    }
};