以下文章来源于数据结构和算法 ，作者博哥 数据结构和算法 . 《算法秘籍》作者王一博，专注于互联网大厂热点事件和算法题讲解。 一hr在网上发文称：面试了一个985硕士，技术面试通过了， 业务面试官评价项目经验也有，开发 能力也不错，但还是不录用他！因为他期望薪资是28k，25k也可以接受，而公司最多只能给到 25k。录用的话还得跟领导审批，业务面试官也觉得给太高不利于目前团队薪资平衡。 给高了不利于团队薪资平衡？ 哪家公司能做到薪资平衡，一个团队中薪资高低很正常，有的相差 两三倍都有可能，因为每个人的学历不同，工作年薪不同，能力不同，薪资有差别是很正常的。 个人的工资水平是根据个人的综合实力来决定的，而不是根节团队的平均薪资来决定的。 --------------下面是今天的算法题-------------- 来看下今天的算法题，这题是LeetCode的第 1546题：和为目标值且不重叠的非空子数组的最大数 目，难度是中等。 给你一个数组 nums 和一个整数 target 。请你返回 非空不重叠子数组的最大数目，且每个子数组 中数字和都为 target 。 示例1： 输入 ：nums = [1,1,1,1, ...

Group 1 - The article discusses a hiring scenario where a candidate with a master's degree from a prestigious university was not hired due to salary expectations exceeding the company's budget, highlighting the tension between individual salary demands and team salary balance [1][2] - It emphasizes that an individual's salary should be determined by their comprehensive abilities rather than the average salary of the team, suggesting that salary disparities are normal within teams due to varying qualifications and experiences [2] Group 2 - The article presents a coding problem from LeetCode, specifically problem 1546, which involves finding the maximum number of non-overlapping subarrays that sum to a given target [3][8] - It provides examples to illustrate the problem, showing how to identify valid subarrays and the conditions for their selection [4][6] - The solution approach involves using prefix sums and a hashmap to track the indices of sums, ensuring that selected subarrays do not overlap [8][9]