一、原题 Given n, how many structurally unique BST's (binary search trees) t...

一、原题 从数列A[0], A[1], A[2], ..., A[N-1]中选若干个数，要求相邻的数不能都选，也就是说如果选了A[i], 就不能...

一、原题 对于一个01矩阵A，求其中有多少片连成一片的1。每个1可以和上下左右的1相连。 请为下面的Solution类实现解决这一问题的函数co...

一、原题 Given a positive integer n, break it into the sum of at least two p...

一、原题 Given a positive integer n, find the least number of perfect square...

一、原题 Say you have an array for which the ith element is the price of a g...

一、原题 Write a program to find the n-th ugly number. Ugly numbers are posi...

198. 动态规划：偷马 一、原题 You are a professional robber planning to rob houses a...