LC刷题第三天

招商银行信用卡

三数之和

枚举左端点，通过双指针+排序优化右端点的枚举

// shiran
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> PII;

class Solution
{
public:
    vector<vector<int>> threeSum(vector<int> &a)
    {
        sort(all(a));
        int n = sz(a);
        vector<vector<int>> res;
        rep(i, 0, n)
        {
            if (i && a[i] == a[i - 1])
                continue;
            int k = n - 1;
            rep(j, i + 1, k)
            {
                if (j > i + 1 && a[j] == a[j - 1])
                    continue;
                while (k > j && a[i] + a[j] + a[k] > 0)
                    k--;
                if (k > j && a[i] + a[j] + a[k] == 0)
                    res.pb({a[i], a[j], a[k]});
            }
        }
        return res;
    }
};

198. 打家劫舍

一道状态机DP，考虑第i家偷或者不偷的两种情况，如果偷，那么i-1家不能偷，如果不偷从i-1家两个状态都可以转移过来

// shiran
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> PII;

class Solution
{
public:
    int rob(vector<int> &nums)
    {
        int n = sz(nums);
        if (n == 1)
            return nums[0];
        int a = nums[0], b = 0;
        int x = 0, y = 0;
        rep(i, 1, n)
        {
            x = nums[i] + b;
            y = max(a, b);
            a = x;
            b = y;
        }
        return max(x, y);
    }
};

编程能力

150. 逆波兰表达式求值

使用栈模拟计算过程即可，可以通过集合判断是不是符号，注意栈出栈的顺序

// shiran
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> PII;

class Solution
{
public:
    int evalRPN(vector<string> &a)
    {
        stack<int> stk;
        int n = sz(a);
        set<string> S = {"+", "-", "*", "/"};
        for (auto &s : a)
        {
            if (!S.count(s))
            {
                stk.push(stoi(s));
            }
            else
            {
                int x = stk.top();
                stk.pop();
                int y = stk.top();
                stk.pop();
                if (s == "*")
                    stk.push(y * x);
                else if (s == "/")
                    stk.push(y / x);
                else if (s == "+")
                    stk.push(y + x);
                else
                    stk.push(y - x);
            }
        }
        return stk.top();
    }
};

66. 加一

模拟即可，特判全都是9的情况

// shiran
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> PII;

class Solution
{
public:
    vector<int> plusOne(vector<int> &d)
    {
        int n = sz(d);
        int k = n - 1;
        d[k] ++ ;
        while (k >= 0 && d[k] == 10)
        {
            d[k] = 0;
            k--;
            if (k >= 0) d[k] ++ ;
        }
        if (k < 0)
        {
            d.pb(1);
            reverse(all(d));
        }
        return d;
    }
};

力扣杯竞赛真题集

LCP 28. 采购方案

// shiran
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
class Solution
{
public:
    int purchasePlans(vector<int> &nums, int target)
    {
        sort(all(nums));
        ll res = 0;
        for (int i = 0, j = sz(nums) - 1; i < j; i++)
        {
            while (j >= 0 && nums[i] + nums[j] > target)
                j--;
            if (j > i)
                res = (res + j - i) % mod;
        }
        return res;
    }
};