benbenab的专栏

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.class Solution {public: int minimumTotal(vector > &triangle) {

Best Time to Buy and Sell StockSay you have an array for which the ith element is the price of a given stock on day i.1  If you were only permitted to complete at most one transaction (i

Unique Binary Search Trees Given n, how many structurally unique BST's (binary search trees) that store values 1...n?class Solution {public:    int numTrees(int n) {        // Star

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a w

Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be n

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] ha