1、修改解决方案文件，即.sln文件： 用记事本打开.sln文件，把其中的Microsoft Visual Studio Solution File, Format Version 12.00# Visual Studio 2012 修改成Microsoft Visual Studio Solu.....
分类：
其他好文 时间：
2014-08-08 23:43:16
阅读次数：
356
i have such a long time fall in love with ubuntu , but i found it's much unconfortable for me with a lenovo y460n , that owning a intel display card a...
分类：
其他好文 时间：
2014-08-08 23:39:17
阅读次数：
379
Problem Description:
Two elements of a binary search tree (BST) are swapped by mistake.
Recover the tree without changing its structure.
Note:
A solution using O(n)
space is pretty straigh...
分类：
其他好文 时间：
2014-08-08 21:22:36
阅读次数：
315
Problem Description:
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
For example, given n = 3, a solution set is:
"((()))", "(()())",...
分类：
其他好文 时间：
2014-08-08 21:20:46
阅读次数：
327
一、LNMP1.安装wget -c http://soft.vpser.net/lnmp/lnmp1.1-full.tar.gz && tar zxf lnmp1.1-full.tar.gz && cd lnmp1.1-full && ./centos.sh2.根据需求升级./upgrade_ngi...
分类：
Web程序 时间：
2014-08-08 17:50:26
阅读次数：
282
No limit to transaction count, so it is a recursive sum calculation. Take care of boundary condition.class Solution {public: int maxProfit(vector &...
分类：
其他好文 时间：
2014-08-08 15:58:06
阅读次数：
212
Also the very first problem on EPI.class Solution {public: int maxProfit(vector &prices) { size_t len = prices.size(); if (len = pric...
分类：
其他好文 时间：
2014-08-08 15:53:26
阅读次数：
170
Problem Description:
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
Given an integer n, return all distinct solution...
分类：
其他好文 时间：
2014-08-08 12:46:55
阅读次数：
180
My first solution was DFS - TLE. Apparently, DFS with TLE usually means DP.1D DP + Rolling Array:class Solution {public: bool wordBreak(string s, u...
分类：
其他好文 时间：
2014-08-08 08:27:25
阅读次数：
280
我的思路：循环遍历输入的单词，每次获取一组符合 fullJustify(vector &words, int L) { 2 // Note: The Solution object is instantiated only once. 3 vector res; 4 ...
分类：
其他好文 时间：
2014-08-08 01:35:44
阅读次数：
239
