![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法分析
文章平均质量分 69
Llunnn
这个作者很懒,什么都没留下…
展开
-
LeetCode 23. Merge k Sorted Lists
分治算法练习(二)这周课上学习的还是分治算法,比较高级的内容是利用快速傅立叶进行的多项式乘法计算。然而网站上divide & conquer的tag似乎没有这类题目(倒是有许多dp的题)(虽然即使有..也不会做…)嗯..于是避开dp继续选择了归并排序的题目,难度为Hard。(感觉实际难度只能算Easy?)题目描述很简单: Merge k sorted linked lists and retur原创 2017-09-18 20:59:32 · 470 阅读 · 0 评论 -
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 stopping you from robbing each of them is that adjacent h原创 2018-01-19 00:27:35 · 149 阅读 · 0 评论 -
LeetCode 70. Climbing Stairs
题目描述You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a positive原创 2018-01-19 00:16:53 · 134 阅读 · 0 评论 -
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],the contiguous subarray [4,-1,2,1] has原创 2018-01-19 00:01:24 · 146 阅读 · 0 评论 -
LeetCode 134. Gas Station
LeetCode 134原创 2018-01-02 21:48:17 · 228 阅读 · 0 评论 -
LeetCode 403. Frog Jump
LeetCode 403原创 2018-01-02 13:23:49 · 294 阅读 · 0 评论 -
LeetCode 316. Remove Duplicate Letters
leetcode 316原创 2017-12-26 18:54:48 · 194 阅读 · 0 评论 -
LeetCode 115. Distinct Subsequences
Distinct Subsequences原创 2017-12-07 00:44:24 · 158 阅读 · 0 评论 -
LeetCode 123.Best Time to Buy and Sell Stock III
LeetCode123原创 2017-12-06 15:23:50 · 214 阅读 · 0 评论 -
LeetCode 407. Trapping Rain Water II
LeetCode 407原创 2017-11-30 22:36:11 · 257 阅读 · 0 评论 -
LeetCode 97. Interleaving String
Dinamic Programming原创 2017-11-03 22:01:34 · 175 阅读 · 0 评论 -
LeetCode 410. Split Array Largest Sum
题目描述:Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m原创 2017-11-17 17:00:12 · 262 阅读 · 0 评论 -
LeetCode 329. Longest Increasing Path in a Matrix
DFS原创 2017-10-12 21:20:46 · 232 阅读 · 0 评论 -
LeetCode 120. Triangle
Dynamic Programming原创 2017-10-28 13:42:02 · 228 阅读 · 0 评论 -
LeetCode 417. Pacific Atlantic Water Flow
BFS原创 2017-10-11 11:26:35 · 416 阅读 · 0 评论 -
LeetCode 310. Minimum Height Trees
图中的路径原创 2017-10-08 00:48:50 · 390 阅读 · 0 评论 -
LeetCode 315. Count of Smaller Numbers After Self
分治算法练习原创 2017-09-10 23:10:02 · 266 阅读 · 0 评论 -
LeetCode 207. Course Schedule
图和dfs原创 2017-09-27 11:50:53 · 213 阅读 · 0 评论 -
NP完全问题证明:hitting set problem
hitting set problem:In the HITTING SET problem, we are given a family of sets {S1, S2, ..., Sn} and a budget b, and we wish to find a set H of size 给定一些集合{S1, S2, ..., Sn},和一个预算b,我们希望找到一个不超过b个元素的集原创 2018-01-08 11:16:51 · 1148 阅读 · 0 评论