Llunnn的博客

分治算法练习（二）这周课上学习的还是分治算法，比较高级的内容是利用快速傅立叶进行的多项式乘法计算。然而网站上divide & conquer的tag似乎没有这类题目（倒是有许多dp的题）（虽然即使有..也不会做…）嗯..于是避开dp继续选择了归并排序的题目，难度为Hard。（感觉实际难度只能算Easy?）题目描述很简单： Merge k sorted linked lists and retur

题目描述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

题目描述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

题目描述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

LeetCode 134

LeetCode 403

leetcode 316

Distinct Subsequences

LeetCode123

LeetCode 407

Dinamic Programming

题目描述：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

DFS

Dynamic Programming

BFS

图中的路径

分治算法练习

图和dfs

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个元素的集