最新 最热

LeetCode 0318 - Maximum Product of Word Lengths

Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that eac...

2021-08-11
1

LeetCode 0315 - Count of Smaller Numbers After Self

You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elemen...

2021-08-11
1

LeetCode 0300 - Longest Increasing Subsequence

Given an unsorted array of integers, find the length of longest increasing subsequence.

2021-08-11
1

C++ 06 - new

关于c++中的new, 主要分为operator new 和 new operator.

2021-08-11
1

LeetCode 0368 - Largest Divisible Subset

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies:

2021-08-11
1

LeetCode 0334 - Increasing Triplet Subsequence

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

2021-08-11
1

LeetCode 0347 - Top K Frequent Elements

Given a non-empty array of integers, return the k most frequent elements.

2021-08-11
1

LeetCode 0322 - Coin Change

You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make ...

2021-08-11
1

LeetCode 0327 - Count of Range Sum

Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Range sum S(i, j) is defined as the sum of the elements in nu...

2021-08-11
1

LeetCode 0386 - Lexicographical Numbers

Given an integer n, return 1 - n in lexicographical order.

2021-08-11
1