- 博客(7)
- 收藏
- 关注
RSS订阅原创 64. Minimum Path Sum
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.Note: You can only move either down or right at any...
2018-04-30 23:47:04
104
原创 328. Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in pla...
2018-04-29 00:33:21
146
原创 8. String to Integer (atoi)
Implement atoi which converts a string to an integer.The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this ...
2018-04-26 00:21:50
143
原创 300. Longest Increasing Subsequence
300. Longest Increasing SubsequenceGiven an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subseque...
2018-04-22 23:30:27
118
原创 216. Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Example 1:Input: k = 3, n ...
2018-04-21 00:25:06
161
原创 01背包 和 完全背包
题目：有价值为v[i]、重量为w[i]的N个物品（每个物品仅有一个）及容量为W的背包，现要求在物品总重量不超过W的前提下选择总价值尽可能高的物品放进背包里。分析：用一个二维数组T[i][j]表示背包的容量为j，物品数为1~i时的最大价值，T[i][j]只有选择第i种物品或者不选第i种物品两种可能，因此状态方程可写成T[i][j]=max(T[i-1][j],T[i-1][j-w[i]]+v[i])...
2018-04-16 00:42:43
183
原创 TypeScript VS JavaScript
TypeScript是JavaScript的超集并且兼容 JavaScript(因为TS需要编译成JS文件)，可以载入 JavaScript 代码然后运行。TypeScript 在JavaScript 上增加的地方包括：接口、类、模块、泛型、可选参数(在参数后面加？)和默认参数、通过类型注解提供编译时的静态类型检查(也可以不写类型，由开发者自由选择)、加入注释，让编译器理解所支持的对象和函数，编...
2018-04-13 00:14:29
264
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人