摘要:
打卡第九天 2道中等题 题目: 代码: class Solution { public: int longestOnes(vector<int>& nums, int k) { int ans = 0, left = 0, cnt0 = 0; for (int right = 0; right < 阅读全文
摘要:
打卡第七天 2道中等题 题目: 代码: class Solution { public: int equalSubstring(string s, string t, int maxCost) { int n = s.length(); vector<int> diff(n, 0);//创建数组存储 阅读全文