1 import java.util.ArrayList; 2 import java.util.List; 3 4 public class BinarySearchTree { 5 6 // 树的根结点 7 private TreeNode root = nu...
分类：
编程语言 时间：
2014-07-16 23:14:45
阅读次数：
365
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
分类：
其他好文 时间：
2014-07-07 23:16:52
阅读次数：
197
http://www.sconsolidator.com/updateInstallationTo use SConsolidator, you first have to installSCons(version 2.0 is the minimum requirement). SConsolid...
分类：
系统相关 时间：
2014-07-07 16:19:42
阅读次数：
458
class Solution {public: int minPathSum(vector > &grid) { int rows = grid.size(); if (rows pathsum(cols + 1, INT_MAX); pathsum...
分类：
其他好文 时间：
2014-06-30 13:23:04
阅读次数：
153
条件操作符是向右关联的，从左到右进行计算，于是a?b:c?d:e 应理解为 a?b:(c?d:e)。在c#2.0里面实现了Nullable数据类型，放弃对object数据进行 if（object==null）这样的判断了。同时你会发现，在数据库应用上，数据库中有的字段允许取空值，在C#世界中引入nu...
分类：
其他好文 时间：
2014-06-30 12:27:39
阅读次数：
171
题目
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...
分类：
其他好文 时间：
2014-06-30 11:10:34
阅读次数：
211
题目
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
You have the following 3 operations permitte...
分类：
其他好文 时间：
2014-06-30 00:46:38
阅读次数：
262
题目
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).
For example,
S = "ADOBECODEBANC"
T = "ABC"
Minimum wi...
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.
分类：
其他好文 时间：
2014-06-27 23:02:33
阅读次数：
258
网页宽度页面box不要写宽度或width:100%之类的去掉头部加上下面代码：<metaname="viewport"content="width=device-width,initial-scale=1.0,minimum-scale=0.5,maximum-scale=2.0,user-scalable=yes"/>图片宽度<scripttype="text/javascript">functioninit(){varji..
分类：
移动开发 时间：
2014-06-27 07:05:34
阅读次数：
239
