2019年3月29日
LeetCode 525. Contiguous Array
摘要： Problem Description: Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. 题解： 这个题很容易想到复杂度为O(n^2)的暴力方法。 阅读全文
posted @ 2019-03-29 17:00 起点菜鸟 阅读(120) 评论(0) 推荐(0)
LeetCode 713. Subarray Product Less Than K
摘要： Problem Description: Your are given an array of positive integers nums. Count and print the number of (contiguous) subarrays where the product of all 阅读全文
posted @ 2019-03-29 14:05 起点菜鸟 阅读(141) 评论(0) 推荐(0)