题目描述:
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 ...
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 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 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 ...
LeetCode 697. Degree of an Array
Given a non-empty array of non-negative integers nums
, the degree of this array is defined as the maximum frequency of any one of its elements.
Your task is to find the smallest possible ...
LeetCode 692. Top K Frequent Words
Given a non-empty list of words, return the k most frequent elements.
Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word ...