525. Contiguous Array
来源:互联网 发布:淘宝网购物女装短裙 编辑:程序博客网 时间:2024/05/22 12:01
Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.
Example 1:
Input: [0,1]Output: 2Explanation: [0, 1] is the longest contiguous subarray with equal number of 0 and 1.
Example 2:
Input: [0,1,0]Output: 2Explanation: [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.
Note:The length of the given binary array will not exceed 50,000.
Subscribe to see which companies asked this question.
Links: https://leetcode.com/articles/contiguous-array/
Java Code:
public class Solution { public int findMaxLength(int[] nums) { if (null == nums || nums.length < 2) { return 0; } int count = 0; int maxLen = 0; // sum, idex Map<Integer, Integer> sumIdx = new HashMap<>(); sumIdx.put(0, -1); for (int i = 0; i < nums.length; i++) { count += (nums[i] == 0 ? -1 : 1); if (sumIdx.containsKey(count)) { maxLen = Math.max(maxLen, i - sumIdx.get(count)); } else { sumIdx.put(count, i); } } return maxLen; }}
0 0
- LeetCode 525. Contiguous Array
- Leetcode 525. Contiguous Array
- 525. Contiguous Array
- 525. Contiguous Array
- 525. Contiguous Array
- [LeetCode]525. Contiguous Array
- 525. Contiguous Array Medium
- 525. Contiguous Array
- 525. Contiguous Array
- [leetcode] 525. Contiguous Array
- [leetcode]525. Contiguous Array
- 525. Contiguous Array
- 525. Contiguous Array
- LeetCode 525. Contiguous Array
- 525. Contiguous Array 题解
- [LeetCode] 525. Contiguous Array
- 525. Contiguous Array
- leetcode 525. Contiguous Array
- nginx发起http请求 使用cosocket
- 图像比较之模板匹配
- Opencv源码分析HoughCircles
- Android O(SDK 8.0)新特性
- 蓝底彩照变白底,MATLAB能帮您实现
- 525. Contiguous Array
- activiti学习笔记5--history configuration--20170405
- convolution by numpy
- Hdu-1172-猜数字 [枚举]
- 线程同步与互斥——信号量
- Python开发必备神器之一:virtualenv
- 递归递推练习―G―小银考呀考不过四级
- Java8---5.方法引用
- 如何获取大量随机数