2020
03-16
03-16
[LeetCode每日一题]264. Ugly Number II
![[LeetCode每日一题]264. Ugly Number II](https://weiguangli.com/wp-content/themes/frontopen2_v1.5.04.15/timthumb.php?src=https://weiguangli.com/wp-content/uploads/2020/02/LeetCode_Sharing.png&h=140&w=205&zc=1)
题目如下：
Write a program to find the n-th ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.
Example:
Input: n.... Read More >
分类目录归档：算法
题目如下：
Write a program to find the n-th ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.
Example:
Input: n.... Read More >
2020
03-16
03-16
[LeetCode每日一题]263. Ugly Number
题目如下：
Write a program to check whether a given number is an ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.... Read More >
2020
03-12
03-12
[LeetCode每日一题]213. House Robber II
题目如下：
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this plac.... Read More >
2020
03-12
03-12
[LeetCode每日一题]198. House Robber
题目如下：
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint sto.... Read More >
2020
03-11
03-11
[LeetCode每日一题]140. Word Break II
题目如下：
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each .... Read More >
2020
03-08
03-08
[LeetCode每日一题]139. Word Break
题目如下：
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separa.... Read More >
题目如下：
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n.
Example:
Input: 3
Output:
[
[1.... Read More >
题目如下：
Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n?
Example:
Input: 3
Output: 5
Explanation:
Given .... Read More >
2020
03-05
03-05
[LeetCode每日一题]64. Minimum Path Sum
题目如下：
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along it.... Read More >
2020
03-04
03-04
[LeetCode每日一题]63. Unique Paths II
题目如下：
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
The robot can only move either down or right .... Read More >