作者归档:在线疯狂

RSS feed of 在线疯狂

[LeetCode]Falling Squares

题目描述:

LeetCode 699. Falling Squares

On an infinite number line (x-axis), we drop given squares in the order they are given.

The i-th square dropped (positions[i] = (left, side_length)) is a square with the left-most point being positions[i ...

继续阅读

[LeetCode]Partition to K Equal Sum Subsets

题目描述:

LeetCode 698. Partition to K Equal Sum Subsets

Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into k non-empty subsets whose sums are all equal.

Example 1:

Input ...

继续阅读

[LeetCode]Count Binary Substrings

题目描述:

LeetCode 696. Count Binary Substrings

Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively ...

继续阅读