上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 38 下一页
摘要: 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 nee 阅读全文
posted @ 2019-08-30 06:46 Review->Improve 阅读(181) 评论(0) 推荐(0)
摘要: mplement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the given leng 阅读全文
posted @ 2019-08-07 12:06 Review->Improve 阅读(1277) 评论(0) 推荐(0)
摘要: A cryptarithmetic puzzle is a mathematical game where the digits of some numbers are represented by letters. Each letter represents a unique digit. Fo 阅读全文
posted @ 2019-08-06 10:17 Review->Improve 阅读(1509) 评论(0) 推荐(0)
摘要: There are N courses, labelled from 1 to N. We are given relations[i] = [X, Y], representing a prerequisite relationship between course X and course Y: 阅读全文
posted @ 2019-08-01 10:15 Review->Improve 阅读(3679) 评论(0) 推荐(0)
摘要: Given a non-decreasing array of positive integers nums and an integer K, find out if this array can be divided into one or more disjoint increasing su 阅读全文
posted @ 2019-07-15 22:11 Review->Improve 阅读(831) 评论(0) 推荐(0)
摘要: Typically, an implementation of in-order traversal of a binary tree has O(h) space complexity, where h is the height of the tree. Write a program to c 阅读全文
posted @ 2019-07-10 22:40 Review->Improve 阅读(735) 评论(0) 推荐(0)
摘要: Given a sorted array of non-negative integers, find the smallest positive integer that is not the sum of a subset of the array. For example, for the i 阅读全文
posted @ 2019-07-10 11:43 Review->Improve 阅读(438) 评论(0) 推荐(0)
摘要: LeetCode 424. Longest Repeating Character Replacement Given a string that consists of only uppercase English letters, you can replace any letter in th 阅读全文
posted @ 2019-04-13 03:48 Review->Improve 阅读(421) 评论(0) 推荐(0)
摘要: Given a set of closed intervals, find the smallest set of numbers that covers all the intervals. If there are multiple smallest sets, return any of th 阅读全文
posted @ 2019-03-30 01:42 Review->Improve 阅读(784) 评论(0) 推荐(0)
摘要: Given a string which we can delete at most k, return whether you can make a palindrome. For example, given 'waterrfetawx' and a k of 2, you could dele 阅读全文
posted @ 2019-03-29 12:31 Review->Improve 阅读(294) 评论(0) 推荐(0)
上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 38 下一页