中级算法第一天：数组和字符串

最新推荐文章于 2024-06-22 16:35:45 发布

Shirandexiaowo

最新推荐文章于 2024-06-22 16:35:45 发布

阅读量227

点赞数

分类专栏： Leetcode刷题文章标签：算法 leetcode 哈希算法

本文链接：https://blog.csdn.net/MATLAB2020ab/article/details/126611598

版权

Leetcode刷题专栏收录该内容

40 篇文章 0 订阅

订阅专栏

三数之和

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int n = nums.size();
        vector<vector<int>> res;
        for (int i = 0; i < n; i ++ ) {
            if (i && nums[i] == nums[i - 1]) continue;
            int k = n - 1;
            for (int j = i + 1; j < k; j ++ ) {
                if (j > i + 1 && nums[j] == nums[j - 1]) continue;
                while (k > j && nums[i] + nums[j] + nums[k] > 0) k -- ;
                if (k != j && nums[i] + nums[j] + nums[k] == 0)
                    res.push_back({nums[i], nums[j], nums[k]});
            }
        }
        return res;
    }
};

矩阵置零

class Solution {
public:
    void setZeroes(vector<vector<int>>& a) {
        int n = a.size(), m = a[0].size();
        vector<int> r(n, 0), c(m, 0);
        for (int i = 0; i < n; i ++ )
            for (int j = 0; j < m; j ++ )
                if (a[i][j] == 0)
                    r[i] = 1, c[j] = 1;
        for (int i = 0; i < n; i ++ )
            if (r[i])
                for (int j = 0; j < m; j ++ )
                    a[i][j] = 0;
        
        for (int i = 0; i < m; i ++ )
            if (c[i])
                for (int j = 0; j < n; j ++ )
                    a[j][i] = 0;
    }
};

49. 字母异位词分组

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        unordered_map<string, vector<string>> hash;
        for (auto& str : strs) {
            string s = str;
            sort(s.begin(), s.end());
            hash[s].push_back(str);
        }

        vector<vector<string>> res;
        for (auto& t : hash) res.push_back(t.second);
        return res;
    }
};

3. 无重复字符的最长子串

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        map<char, int> mp;
        int res = 0;
        for (int i = 0, j = 0; i < s.size(); i ++ ) {
            mp[s[i]] ++ ;
            while (mp[s[i]] > 1) -- mp[s[j ++ ]];
            res = max(res, i - j + 1);
        }
        return res;
    }
};

5. 最长回文子串

class Solution {
public:
    string longestPalindrome(string s) {
        int n = s.size();
        string str;
        for (int i = 0; i < n; i ++ ) {
            int l = i - 1, r = i + 1;
            while (l >= 0 && r < n && s[l] == s[r]) l -- , r ++ ;
            if (r - l - 1 > str.size()) str = s.substr(l + 1, r - l - 1);

            l = i, r = i + 1;
            while (l >= 0 && r < n && s[l] == s[r]) l -- , r ++ ;
            if (r - l - 1 > str.size()) str = s.substr(l + 1, r - l - 1);
        }
        return str;
    }
};

334. 递增的三元子序列

class Solution {
public:
    bool increasingTriplet(vector<int>& a) {
        int n = a.size();
        vector<int> maxn(n, INT_MIN);
        for (int i = n - 1; i; i -- )
            if (i == n - 1)
                maxn[i] = a[i];
            else
                maxn[i] = max(a[i], maxn[i + 1]);
        int minn = a[0];
        for (int i = 1; i < n - 1; i ++ )
        {
            if (minn < a[i] && a[i] < maxn[i + 1])
                return true;
            minn = min(minn, a[i]);
        }    
        return false;
    }
};