Leetcode
文章平均质量分 72
Leetcode题解
Wuzihui___
这个作者很懒,什么都没留下…
展开
-
动态规划 — LIS
动态规划介绍动态规划是比较重要的算法啦,打算慢慢写几篇博客总结一下。 动态规划的基本思想是:要求原问题的解,先求出更小一些的问题的解,由子问题的解通过某种方式得到原问题的解。通常,我们也称每个子问题是一个状态,由子问题计算原问题,称为状态迁移由子问题计算原问题的方式称为状态转移方程一个动态规划算法的复杂度通常取决于状态的数量和状态迁移的复杂度以上是有关动态规划的一些基本概念和概括。LIS问原创 2017-10-29 12:08:21 · 760 阅读 · 0 评论 -
Leetcode494. Target Sum
题目: You are given a list of non-negative integers, a1, a2, …, an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol. Find ou原创 2018-01-03 23:26:21 · 380 阅读 · 0 评论 -
吝啬SAT问题是NP完全问题
思路要证明吝啬SAT问题是一个NP完全问题,可以通过尝试将一个已知的NP完全问题归约到吝啬SAT问题。 从问题的形式上来看,可以通过尝试将SAT问题归约到吝啬SAT问题 SAT问题的定义如下: The Boolean satisfiability problem (SAT) is, given a formula, to check whether it is satisfiable.原创 2018-01-03 21:05:08 · 748 阅读 · 0 评论 -
Leetcode Two Maximum Subarray Questions
Leetcode 53. Maximum Subarray题目: 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],原创 2017-12-18 15:55:01 · 362 阅读 · 0 评论 -
Leetcode 322. Coin Change
题目描述 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 need to make up that amount. If that amount of原创 2017-12-25 15:02:01 · 427 阅读 · 0 评论 -
leetcode120 Triangle
题目 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,5原创 2017-11-27 09:54:41 · 299 阅读 · 0 评论 -
Leetcode62-63 Unique Paths
Unique Paths题目 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 point in time. The robot is tr原创 2017-12-11 09:57:47 · 299 阅读 · 0 评论 -
Leetcode546. Remove Boxes(Hard)
题目 Given several boxes with different colors represented by different positive numbers. You may experience several rounds to remove boxes until there is no box left. Each time you can choose some原创 2017-12-04 21:49:08 · 1695 阅读 · 0 评论 -
leetcode Some questions of Edit Distance
leetcode72 Edit Distance题目 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 o原创 2017-11-13 09:08:48 · 352 阅读 · 0 评论 -
leetcode4. Median of Two Sorted Arrays
题面 There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [原创 2017-11-09 12:27:22 · 291 阅读 · 0 评论 -
leetcode House Robber I II
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 stopping you from robbing each of them原创 2017-11-20 09:18:58 · 326 阅读 · 0 评论