题目描述：
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]
Output: 2
Explanation: [0, 1] is the longest contiguous subarray with ...
标签归档：leetcode
[LeetCode]Contiguous Array
[LeetCode]Beautiful Arrangement
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 526. Beautiful Arrangement
Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of the following is true for the i ...
[LeetCode]Detect Capital
作者是
发布于
在
LeetCode.
题目描述：
Given a word, you need to judge whether the usage of capitals in it is right or not.
We define the usage of capitals in a word to be right when one of the following ...
[LeetCode]Coin Change 2
作者是
发布于
在
LeetCode.
题目描述：
You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume that you have infinite ...
[LeetCode]Longest Palindromic Subsequence
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 516. Longest Palindromic Subsequence
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.
Example 1:
Input:
"bbbab"
Output:
4
One possible longest palindromic subsequence ...