Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ...
分类：
其他好文 时间：
2014-07-13 08:13:53
阅读次数：
251
执行# python setup.py install 时发生如下错误Traceback (most recent call last): File "setup.py", line 6, in from setuptools import setup, find_packagesImpo...
分类：
编程语言 时间：
2014-07-13 00:57:46
阅读次数：
279
解决在SharePoint 2010 部署自己Event Handler后，解决”Could not load file or assembly 'TIBCO.EMS, Version=1.0.700.12, Culture=neutral, PublicKeyToken=5b83db8ff05c64ba' or one of its dependencies. The system cannot find the file specified. “的问题...
分类：
其他好文 时间：
2014-07-12 21:37:56
阅读次数：
283
问题：
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:
Only one letter can be changed at a time
Each intermediate wo...
分类：
编程语言 时间：
2014-07-12 19:21:38
阅读次数：
290
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, whe...
分类：
其他好文 时间：
2014-07-12 19:06:27
阅读次数：
204
find . ! -wholename '*.svn*' -print | xargs grep "img" | awk -F ':.' '{print $1}' | uniq...
分类：
其他好文 时间：
2014-07-12 17:41:47
阅读次数：
223
用stl中的bsearch实现二分查找，解hdu2141。欢迎讨论...
分类：
其他好文 时间：
2014-07-12 17:17:43
阅读次数：
109
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on...
分类：
其他好文 时间：
2014-07-12 16:31:50
阅读次数：
192
枚举最小边进行kruskal。#include #include using namespace std;#define maxn 120#define maxm 10000struct edge{ int u,v,w;}e[maxm];int p[maxn],n,m;int find(int...
分类：
其他好文 时间：
2014-07-12 14:37:52
阅读次数：
250
exec sp_databases; --查看数据库exec sp_tables; --查看表exec sp_columns Categories;--查看列exec sp_helpIndex Categories;--查看索引exec sp_helpConstraint Catego...
分类：
数据库 时间：
2014-07-12 14:10:43
阅读次数：
178
