LeetCode 525: Continuous Array

阿新 • • 發佈：2017-09-03

etc a star sta div .get mmap blog tin star

Note: 1. Remember to intial (0, -1) since this kind of problems need a starting point.

class Solution {
    public int findMaxLength(int[] nums) {
        if (nums.length < 2) {
            return 0;
        } 
        
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 0) {
                nums[i]  
= -1;
            }
        }
        
        Map<Integer, Integer> sumMap = new HashMap<>();
        sumMap.put(0, -1);
        int sum = 0;
        int result = 0;
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            if (!sumMap.containsKey(sum)) {
                sumMap.put(sum, i);
            }  
else {
                result = Math.max(result, i - sumMap.get(sum));
            }
        }
        return result;
    }
}

etc a star sta div .get mmap blog tin star Note: 1. Remember to intial (0, -1) since this kind of problems need a starting point. class

LeetCode 525. Contiguous Array

Contiguous Array - LeetCode Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1:

[leetCode刷題筆記]525. Contiguous Array

用類似動態規劃的思路來解決。用HashMap是因為HashMap查詢key更快。 public class Solution { public int findMaxLength(int[]

leetcode題解-525. Contiguous Array

題目：Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1: Input: [0,1] O

[Leetcode] convert sorted array to binary search tree

get left bsp sea class 方法 return for target Given an array where elements are sorted in ascending order, convert it to a height balanced

leetcode 659. Split Array into Consecutive Subsequences

掃描手寫 bool continue sorted int dup into -- You are given an integer array sorted in ascending order (may contain duplicates), you need to

LeetCode 523: Continuous Subarray Sum

div nbsp span -1 logs tin dex spa pre Note: 　　1. The sum array need to be very clear that 0th is 0. So the sum[i] means from 0 to i - 1 s

LeetCode 189. Rotate Array （旋轉數組）

note div 題目方法 leetcode array beats not htm Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the

LeetCode 659: Split Array into Consecutive Subsequence

con num into split boolean elong for def arr Note: 1. If it does not belong any sequences : append.getOrDefault(num, 0) == 0, create a ne

[LeetCode] Longest Continuous Increasing Subsequence 最長連續遞增序列

xpl eas its rate 序列最長 array incr integer Given an unsorted array of integers, find the length of longest continuous increasing subseq

525. Contiguous Array

sub 哈希表我們 trick ray div binary imu number Given a binary array, find the maximum length of a contiguous subarray with equal number of 0

leetCode-Merge Sorted Array

number int ret script tty style elements scrip clas Description: Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1

[Leetcode] Merge Sorted Array

amp from sum esp 題解 eat integer 合並需要 Merge Sorted Array 題解題目來源：https://leetcode.com/problems/merge-sorted-array/description/ Descripti

Leetcode:Merge Sorted Array

element hold ted clas ins ini num bre 說明 Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. No

[LeetCode] 189. Rotate Array 旋轉數組

lee self public try color with += credit 解法 Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, th

leetcode 189. Rotate Array

span vector turn rotate ray while tco leetcode arr 註意k可能大於length class Solution { public: void rotate(vector<int>& nums, i

[leetcode] Product of Array Except Self

rpo lee 般的兩個 cep array int nbsp and Given an array nums of n integers where n > 1, return an array output such that output[i] is e

[LeetCode] 805. Split Array With Same Average 用相同均值拆分數組

aud 否則 sed tar into cpp ont lan true In a given integer array A, we must move every element of A to either list B or list C. (B and C ini

[LeetCode] 905. Sort Array By Parity(C++)

Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements o

[LeetCode] 922. Sort Array By Parity II(C++)

Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even. Sort the array so that wh

LeetCode 525: Continuous Array

相關推薦