🔰🔰🔰:困难
🔰🔰:中等
🔰:简单

🔰1662.检查两个字符串数组是否相等

https://leetcode.cn/problems/check-if-two-string-arrays-are-equivalent/

简单的双指针操作

class Solution {
public:
    bool arrayStringsAreEqual(vector<string>& word1, vector<string>& word2) {
        int a = 0, b = 0;
        int i = 0, j = 0;
        int n = word1.size(), m = word2.size();
        while(i < n && j < m)
        {
            if(word1[i][a++] != word2[j][b++]) return false;
            if(a == word1[i].size()){
                a = 0;
                ++i;
            }
            if(b == word2[j].size()){
                b = 0;
                ++j;
            }
        }

        return i == n && j == m;
    }
};

🔰🔰2453.摧毁一系列目标

https://leetcode.cn/problems/destroy-sequential-targets/

暴力, 超时

class Solution {
public:
    int destroyTargets(vector<int>& nums, int space) {
        int n = nums.size();
        map<int, int> mp;
        int maxnum = -1;
        for(int i = 0; i < n; ++i){
            mp[nums[i]] ++;
            maxnum = nums[i]>maxnum ? nums[i]:maxnum;
        }

        int res = 1e9, resnum = -1;
        for(int i = 0; i < n; ++i){
            int t = 0;
            int k = ((maxnum-nums[i])/space)+1;
            for(int j = 0; j <= k; ++j){
                t += mp[nums[i]+space*j];
            }
            if(t >= resnum){
                resnum = t;
                res = res < nums[i] ? res : nums[i];
            }
        }
        return res;
    }
};

原文地址：http://www.cnblogs.com/Knight02/p/16848386.html