algorithm
一些基础算法
lijfrank
Life is too short, recording the fragments of studying.
展开
-
动态规划(dynamic programming)
动态规划(dynamic programming)是运筹学的一个分支,是求解决策过程(decision process)最优化的数学方法。20世纪50年代初美国数学家R.E.Bellman等人在研究多阶段决策过程(multistep decision process)的优化问题时,提出了著名的最优化原理(principle of optimality),把多阶段过程转化为一系列单阶段问题,利用各阶...原创 2019-12-06 16:33:45 · 414 阅读 · 0 评论 -
leetcode题目-动态规划 目录
70、Climbing Stairs 爬楼梯198、House Robber 打家劫舍213、House Robber II(Medium)53、LeetCode 最大子序和322、LeetCode 找零钱120、LeetCode 三角形300、LeetCode 最长上升子序列64、LeetCode 最小路径和174、LeetCode 地下城游戏...原创 2020-05-15 23:32:22 · 180 阅读 · 0 评论 -
300. Longest Increasing Subsequence 最长上升子序列 code
Given an unsorted array of integers, find the length of longest increasing subsequence.Example:Input: [10,9,2,5,3,7,101,18]Output: 4Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.Note:There may be more than原创 2020-05-19 22:33:11 · 188 阅读 · 0 评论 -
120. Triangle 三角形最小路径和 code
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,7], [4,1,8,3]]The minimum path sum from top to botto原创 2020-05-19 22:25:11 · 215 阅读 · 0 评论 -
322. Coin Change 找零钱 code
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 money cannot be made up by any combination of the coins, retur原创 2020-05-19 20:51:33 · 210 阅读 · 0 评论 -
53. Maximum Subarray 最大子序和 code
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explanation: [4,-1,2,1] has the largest sum = 6.Follow up:If you h原创 2020-05-19 15:00:48 · 185 阅读 · 0 评论 -
二叉树code python
class Node: def __init__(self,value=None,left=None,right=None): self.value=value self.left=left #左子树 self.right=right #右子树def preTraverse(root): ''' 前序遍历 ''' if root==None: return原创 2020-05-17 20:57:19 · 215 阅读 · 0 评论 -
337、House Robber III(Medium)打家劫舍 code
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that “all houses in this plac原创 2020-05-17 22:42:29 · 322 阅读 · 0 评论 -
213. House Robber II 打家劫舍 code
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses原创 2020-05-16 00:12:05 · 194 阅读 · 0 评论 -
198. House Robber 打家劫舍 code
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 houses have security system connected and it will automatical原创 2020-05-15 23:25:29 · 169 阅读 · 0 评论 -
70.Climbing Stairs 爬楼梯 code
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 integer.Example 1:Input: 2Output: 2Explanation: There原创 2020-05-13 22:51:05 · 211 阅读 · 0 评论