Just DO IT by luckygxf

摘要： Minimum Path SumGiven amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along ... 阅读全文

摘要： 参考：http://www.cnblogs.com/zhxhdean/archive/2011/03/25/1995431.htmljava中的数据类型，可分为两类：1.基本数据类型，也称原始数据类型。byte,short,char,int,long,float,double,boolean 他们之... 阅读全文

摘要： Binary Tree Inorder TraversalGiven a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ... 阅读全文

摘要： Single NumberGiven an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runti... 阅读全文

摘要： Valid NumberValidate if a given string is numeric.Some examples:"0"=>true" 0.1 "=>true"abc"=>false"1 a"=>false"2e10"=>trueNote:It is intended for the ... 阅读全文

摘要： ZigZag ConversionThe string"PAYPALISHIRING"is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern i... 阅读全文

摘要： 1.KMP简介KMP是一个在字符串str中找一个子串pattern的匹配算法，在BF这种暴力匹配算法的基础上改进的。他是有三个人提出来的，所以用三个人的名字来命名这个算法2.KMP解释昨天和今天看了好几篇KMP的博客，有个人说的挺好的，坚持下去，就会有柳暗花明的感觉，下面是这位锅锅的博客地址，可以去... 阅读全文

摘要： 01背包问题用DP（动态规划实现）背包容量int c = 10物品个数int n = 5物品重量w[] = {0, 2, 2, 6, 5, 4}物品价值v[] = {0, 6, 3, 5, 4, 6}结果存放result[][] = new int[n + 1][c + 1]//result[i][... 阅读全文

摘要： Valid SudokuDetermine if a Sudoku is valid, according to:Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are ... 阅读全文

摘要： Implement strStr()Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.这里用的BF算法... 阅读全文