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 permitted on a word:...
分类：
其他好文 时间：
2014-10-13 20:08:07
阅读次数：
188
编译文件：cc -c one.c two.c 生成.o目标文件
链接文件：cc one.o two.o 默认生成 a.out 执行文件
指定生成的可执行文件名 cc -o one one.o
连续编译、链接：cc one.c cc -o one one.c 中间生成的.o文件会被删除，最后生成执行文件
cc one.c two.c...
分类：
编程语言 时间：
2014-10-13 19:57:37
阅读次数：
350
??
Flip Game
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 31329
Accepted: 13622
Description
Flip game is played on a rectangular 4x4 field with two-sided...
分类：
其他好文 时间：
2014-10-13 19:12:17
阅读次数：
489
1. 架构http://jasig.github.io/cas/4.0.0/planning/Architecture.htmlSystem ComponentsThe CAS server and clients comprise the two physical components of th...
分类：
其他好文 时间：
2014-10-13 16:56:29
阅读次数：
2592
1.一下是几种形式的函数调用：各种调用的效率：在这编文章中有谈到：http://suqing.iteye.com/blog/1981591// Either of the following two patterns can be used to immediately invoke// a fun...
分类：
编程语言 时间：
2014-10-13 14:43:09
阅读次数：
317
1 /** 2 * Definition for singly-linked list. 3 * public class ListNode { 4 * int val; 5 * ListNode next; 6 * ListNode(int x) { 7 * ...
分类：
其他好文 时间：
2014-10-13 13:30:09
阅读次数：
118
【题目】
Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never d...
分类：
其他好文 时间：
2014-10-12 22:29:28
阅读次数：
210
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]...
分类：
其他好文 时间：
2014-10-12 20:53:58
阅读次数：
191
相同的雪花
时间限制：1000 ms | 内存限制：65535 KB
难度：4
描述You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your
program w...
分类：
其他好文 时间：
2014-10-12 20:01:38
阅读次数：
277
Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,...
分类：
其他好文 时间：
2014-10-12 19:42:38
阅读次数：
141
