摘要：
Description Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the larges 阅读全文
摘要：
Description Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. You have the following thre 阅读全文
摘要：
Description The set [1, 2, 3, ..., n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the 阅读全文
摘要：
Description You are given an integer array matchsticks where matchsticks[i] is the length of the ith matchstick. You want to use all the matchsticks t 阅读全文
摘要：
Description You are given an array of integers nums (0-indexed) and an integer k. The score of a subarray (i, j) is defined as min(nums[i], nums[i+1], 阅读全文
摘要：
Description In the "100 game" two players take turns adding, to a running total, any integer from 1 to 10. The player who first causes the running tot 阅读全文
摘要：
Description You are given an m x n integer matrix points (0-indexed). Starting with 0 points, you want to maximize the number of points you can get fr 阅读全文
摘要：
Description You are given an integer array nums and an integer goal. You want to choose a subsequence of nums such that the sum of its elements is the 阅读全文
摘要：
Description You are given an integer array nums. You should move each element of nums into one of the two arrays A and B such that A and B are non-emp 阅读全文
摘要：
Description Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of that array such that for every two cons 阅读全文