题目描述：
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?
题目大意：
你正在爬楼梯。爬到顶部需要n步。
每一次你爬1步或者2步。爬到顶部有多少种不同的方式？ ...
档案日期2015的33
2015年8月17日 - 2015年8月23日
[LeetCode]Climbing Stairs
[LeetCode]Ugly Number II
作者是
发布于
在
LeetCode.
题目描述：
Write a program to find the n-th ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the ...
[LeetCode]Ugly Number
作者是
发布于
在
LeetCode.
题目描述：
Write a program to check whether a given number is an ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since it ...
[LeetCode]Single Number III
作者是
发布于
在
LeetCode.
题目描述：
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
For example:
Given nums = [1, 2, 1, 3, ...
[LeetCode]Word Ladder
作者是
发布于
在
LeetCode.
题目描述：
Given two words (beginWord and endWord), and a dictionary, find the length of shortest transformation sequence from beginWord to endWord, such that:
Only one letter can be changed at a time
Each intermediate word must exist in the dictionary ...