LeetCode 2015.7.9 66,67,70,83,88,100

最新推荐文章于 2024-07-04 07:00:00 发布

Batman_

最新推荐文章于 2024-07-04 07:00:00 发布

阅读量395

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Batman_/article/details/50659738

版权

LeetCode 专栏收录该内容

63 篇文章 0 订阅

订阅专栏

66 Plus One
class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        vector<int>ans;
        ans.clear();
        int len=digits.size()-1;
        int flag=1;
        for(int i=len;i>=0;i--)
        {
            int sum=flag+digits[i];
            flag=sum/10;
            sum%=10;
            ans.push_back(sum);
        }
        if (flag>0) ans.push_back(flag);
        vector<int> finalans;
        finalans.clear();
        for(int i=ans.size()-1;i>=0;i--)
            finalans.push_back(ans[i]);
        return finalans;
    }
};

67 Add Binary
class Solution {
public:
    string addBinary(string a, string b) {
        string x,y,zeros,ans;
        x.clear();
        y.clear();
        zeros.clear();
        if (a.size()<b.size())
        {
            x=b;y=a;
        }
        else
        {
            x=a;y=b;
        }
        int lenx=x.size()-1,leny=y.size()-1;
        for(int i=1;i<=lenx-leny;i++)
            zeros=zeros+"0";
        y=zeros+y;
        int flag=0;
        for(int i=lenx;i>=0;i--)
        {
            int sum=flag+x[i]-'0'+y[i]-'0';
            flag=sum/2;
            sum=sum%2;
            char ch=sum+'0';
            ans+=ch;
        }
        if (flag==1) ans+='1';
        string finalans;
        finalans.clear();
        for(int i=ans.size()-1;i>=0;i--)
            finalans+=ans[i];
        return finalans;
    }
};

70 Climbing Stairs
class Solution {
public:
    int climbStairs(int n) {
        vector<int> f;
        f.clear();
        f.push_back(0);
        f.push_back(1);
        f.push_back(2);
        if (n<=2) return f[n];
        for(int i=3;i<=n;i++)
            f.push_back(f[i-1]+f[i-2]);
        return f[n];
    }
};

83 Remove Duplicates from Sorted List
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        ListNode* originalhead=head;
        if (head==NULL) return head;
        while (head->next!=NULL)
        {
            ListNode* tmp=head->next;
            if (head->val==tmp->val)
            {
                head->next=tmp->next;
                delete(tmp);
            }
            else
                head=head->next;
        }
        return originalhead;
    }
};

88 Merge Sorted Array
class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int it1=m-1,it2=n-1,iter=m+n-1;
        nums1.resize(m+n);
        while (it1>=0 && it2>=0)
        {
            if (nums1[it1]>nums2[it2])
            {
                nums1[iter]=nums1[it1];
                it1--;
            }
            else
            {
                nums1[iter]=nums2[it2];
                it2--;
            }
            iter--;
        }
        while (it1>=0)
        {
            nums1[iter]=nums1[it1];
            iter--;it1--;
        }
        while (it2>=0)
        {
            nums1[iter]=nums2[it2];
            iter--;it2--;
        }
    }
};

100 Same Tree
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        bool flag1,flag2;
        if ((p==NULL)&&(q==NULL)) return true;
        if ((p==NULL)+(q==NULL) ==1) flag1=false; else flag1=true;
        if (flag1)
        {
            if (p->val==q->val) flag2=true; else flag2=false;
        }
        return (flag1 && flag2 && isSameTree(p->left,q->left) && isSameTree(q->right,p->right));
    }
};