The number of steps
Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^
题目描述
Mary stands in a strange maze, the maze looks like a triangle(the first layer have one room,the ...
分类:
其他好文 时间:
2014-10-22 20:22:52
阅读次数:
235
题目:There is a clever algorithm for computing the Fibonacci numbers in a logarithmic number of steps.Recall the transformation of the state variables a...
分类:
其他好文 时间:
2014-10-22 17:46:46
阅读次数:
108
Start building with Ionic!Follow these quick steps and start building high quality mobile apps in minutes. For a more indepth ...
分类:
其他好文 时间:
2014-10-22 00:39:42
阅读次数:
202
Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol...
分类:
其他好文 时间:
2014-10-21 05:43:21
阅读次数:
125
Number Steps
Time Limit: 1000ms Memory limit: 10000K 有疑问?点这里^_^
题目描述
Starting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,... as shown in the...
分类:
其他好文 时间:
2014-10-19 21:29:03
阅读次数:
183
[leetcode]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-10-16 13:02:12
阅读次数:
183
Climbing StairsYou are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct way...
分类:
其他好文 时间:
2014-10-15 19:24:01
阅读次数:
168
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
//第一种解法
class Solution {
pub...
分类:
其他好文 时间:
2014-10-13 23:41:27
阅读次数:
393
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
抽空做了个集成v4l2api, 实力有限, 有粗糙的地方还望不吝赐教 ^_^
v4l2_lib.h
/* This driver provid v4l2 API
*
* (You can use this driver as abouve steps)
*
*
*
* STEP ONE: define value
*
*
* step 1.1: defin...