import java.util.*; public class p11 { public static void main(String[] args) { int []nums ={0,1,0}; int an=findMaxLength(nums); System.out.println(an); } static int findMaxLength(int[] nums) { for(int i = 0; i < nums.length; i++){ if(nums[i] == 0) nums[i] = -1; } Mapmap = new HashMap<>(); map.put(0, -1); int ans = 0, sum = 0; for(int i = 0; i < nums.length; i++){ sum += nums[i]; if(map.containsKey(sum)){ ans = Math.max(ans, i - map.get(sum)); }else map.put(sum, i); } return ans; } }
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)