You 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 ways can you climb...
分类：
其他好文 时间：
2015-03-09 20:38:26
阅读次数：
144
标题：Edit Distance通过率：26.1%难度：难Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counte...
分类：
其他好文 时间：
2015-03-08 20:08:42
阅读次数：
166
擠出機步進馬達的 Steps per Unit 該如何計算?這邊 Steps per Unit 指的是塑料往前推進1mm，步進馬達須要走幾步。依此定義，可知計算方式可以用步進馬達轉一圈需要的步數 除以 步進馬達轉一圈塑料往前推的距離來求解。步進馬達轉一圈需要的步數這樣算：(360/馬達一步走幾度)*...
分类：
其他好文 时间：
2015-03-06 21:57:09
阅读次数：
125
1.题目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?2.解决方案class Solution {
public:
...
分类：
其他好文 时间：
2015-03-06 19:11:17
阅读次数：
113
Climbing Stairs问题：You 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 ...
分类：
其他好文 时间：
2015-03-06 16:52:48
阅读次数：
101
#Rotate an array of?n?elements to the right by?k?steps. #For example, with?n?= 7 and?k?= 3, the array?[1,2,3,4,5,6,7]?is rotated to?[5,6,7,1,2,3,4]. class?Solution:
????#?@param?n...
分类：
其他好文 时间：
2015-03-04 21:15:21
阅读次数：
121
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:...
分类：
其他好文 时间：
2015-03-03 21:52:37
阅读次数：
118
水题，验证压代码能力。。。#include#includeint main(){ int n,x,y; scanf("%d",&n); while(n--){ scanf("%d%d",&x,&y); if (x!=y&&x-2!=y) ...
分类：
其他好文 时间：
2015-03-03 20:34:29
阅读次数：
108
You 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 ways can you climb...
分类：
其他好文 时间：
2015-03-03 20:20:58
阅读次数：
113
Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is
rotated to [5,6,7,1,2,3,4].
#include
using namespace std;
//转置思想
void Re...
分类：
其他好文 时间：
2015-03-02 11:19:16
阅读次数：
126
