12 2022 档案
摘要:class Solution { public: string largestMerge(string word1, string word2) { string ans; int i = 0, j = 0; while (i < word1.size() || j < word2.size())
阅读全文
摘要:简单的模拟 class Solution { public: int finalValueAfterOperations(vector<string>& operations) { int ans = 0; for (auto str : operations) { if (str[0] == 'X
阅读全文
摘要:【LC1799】 class Solution { public: int n; vector<int> dp; //状态DP; vector<vector<int>> gcd; //gcd<i, j>:nums[i], nums[j] gcd的结果; int GCD(int x, int y) {
阅读全文