LeetCode: TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For exa...
分类：
其他好文 时间：
2014-08-25 22:48:14
阅读次数：
306
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.N...
分类：
其他好文 时间：
2014-08-25 20:41:44
阅读次数：
192
创建、管理LVM：创建分区Disk/dev/xvdc:2147MB,2147483648bytes
255heads,63sectors/track,261cylinders
Units=cylindersof16065*512=8225280bytes
Sectorsize(logical/physical):512bytes/512bytes
I/Osize(minimum/optimal):512bytes/512bytes
Diskidentifier:0xd199e24a
De..
分类：
其他好文 时间：
2014-08-24 19:28:44
阅读次数：
387
Minimum palindrome
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 780 Accepted Submission(s): 353
Problem Description
Setting p...
分类：
其他好文 时间：
2014-08-24 18:07:43
阅读次数：
176
How to Make cURL works with cmake
Recently, I want to learn cURL, so downloaded it and compiled it, and use
cmake to manage the project, I wrote a CMakelists.txt as below:
cmake_minimum_req...
分类：
其他好文 时间：
2014-08-24 11:44:22
阅读次数：
179
Triangle
Total Accepted: 16109 Total
Submissions: 60327My Submissions
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row...
分类：
其他好文 时间：
2014-08-23 16:54:11
阅读次数：
253
https://oj.leetcode.com/problems/edit-distance/Edit DistanceGiven two wordsword1andword2, find the minimum number of steps required to convertword1tow...
分类：
编程语言 时间：
2014-08-23 09:56:50
阅读次数：
213
HDU 1394 Minimum Inversion Number (线段树)...
分类：
其他好文 时间：
2014-08-22 14:28:28
阅读次数：
200
1，Selection SortSteps:from 0~n-1, select the minimum element[comparing n-1 times], swap it with the A[0].from 1~n-1,select the minimum element[compari...
分类：
其他好文 时间：
2014-08-21 22:39:14
阅读次数：
268
leetcode的题目Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You h...
分类：
其他好文 时间：
2014-08-21 22:29:54
阅读次数：
279
