shenkunchang1877的博客

刷题参考：https://blog.youkuaiyun.com/IBelieve2016/article/details/104544763 /* Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the length of a longest substring cont

刷题参考：https://blog.youkuaiyun.com/IBelieve2016/article/details/104544763 #include<iostream> #include<vector> #include <unordered_set> #include<string> using namespace std; /* 非重复最长字串 left定位子串开头 用一个set检查当前char[i]是否存在 如果存在将set中的char[left

刷题参考：https://blog.youkuaiyun.com/IBelieve2016/article/details/104544763 /* In a row of trees, the `i`-th tree produces fruit with type `tree[i]`. You start at any tree of your choice, then repeatedly perform the following steps: Add one piece of fruit from th

刷题参考：https://blog.youkuaiyun.com/IBelieve2016/article/details/104544763 #include<iostream> #include<vector> #include <unordered_map> #include<string> using namespace std; /* Given a string, find the length of the longest substring T t.

刷题参考：https://blog.youkuaiyun.com/IBelieve2016/article/details/104544763 #include<iostream> #include<vector> #include <unordered_map> using namespace std; /* Given an unsorted array of nonnegative integers, find a continous subarray which add.

/* Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn't one, return 0 instead. Note: The sum of the entire nums array is guaranteed to fit within the 32-bit signed integer range. Example 1: Inpu.