摘要：
Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation: T 阅读全文
posted @ 2020-03-05 21:51
米开朗菠萝
阅读(129)
评论(0)
推荐(0)
摘要：
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 operations permitt 阅读全文
posted @ 2020-03-05 19:52
米开朗菠萝
阅读(137)
评论(0)
推荐(0)
摘要：
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 its path. 阅读全文
posted @ 2020-03-05 17:14
米开朗菠萝
阅读(126)
评论(0)
推荐(0)
摘要：
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 at any p 阅读全文
posted @ 2020-03-05 13:59
米开朗菠萝
阅读(116)
评论(0)
推荐(0)
摘要：
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Output: 阅读全文
posted @ 2020-03-05 11:41
米开朗菠萝
阅读(93)
评论(0)
推荐(0)
浙公网安备 33010602011771号