题目描述
定一个放有字母和数字的数组,找到最长的子数组,且包含的字母和数字的个数相同。
返回该子数组,若存在多个最长子数组,返回左端点下标值最小的子数组。若不存在这样的数组,返回一个空数组。
示例 1:
输入: ["A","1","B","C","D","2","3","4","E","5","F","G","6","7","H","I","J","K","L","M"]
输出: ["A","1","B","C","D","2","3","4","E","5","F","G","6","7"]
示例 2:
输入: ["A","A"]
输出: []
提示:
- array.length <= 100000
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/find-longest-subarray-lcci
题目分析
今天也是子数组相关的题。
想想能不能用昨天的方法做。也是用前缀和和哈希表,但是前缀和保存从数组开始到第i个元素,字母与数字的个数的差值cur。在哈希表vis中寻找cur,若存在,则从vis[cur]到i的子数组满足字母与数字的个数相等。另一个不同为,哈希表保存cur第一次出现的位置
class Solution {
public:
vector<string> findLongestSubarray(vector<string>& array) {
unordered_map<int, int> vis; //哈希表
vector<string> ret;
int n = array.size();
int ans_len = 0,ans_start=0;
int cur = 0;
vis[0]=-1; //相当于说明:在数组没开始的时候字母和数字的数量相等
for (int i = 0; i < n; ++i) {
if((array[i][0]>='A'&&array[i][0]<='Z')||(array[i][0]>='a'&&array[i][0]<='z')){
cur = cur+1;
}
else cur = cur-1;
if (vis.count(cur)) { //count方法用于查找,若存在则返回1,不存在返回0
if(i-vis[cur]>ans_len){
ans_len = i-vis[cur];
ans_start = vis[cur]+1;
}
}
else vis[cur]=i;
}
for(int i=ans_start;i<ans_start+ans_len;i++){
ret.push_back(array[i]);
}
return ret;
}
};
总结
连续两天的每日一题都是同一种类型,大概是对子数组问题很眼熟了。但是今天因为低级错误被卡了很久,实在不应该。还有就是对vis[0]的初始化问题仍需要注意