摘要：
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 cl 阅读全文
posted @ 2016-12-30 18:47
Hutonm
阅读(137)
评论(0)
推荐(0)
摘要：
Given two strings s and t, write a function to determine if t is an anagram of s. For example,s = "anagram", t = "nagaram", return true.s = "rat", t = 阅读全文
posted @ 2016-12-30 18:20
Hutonm
阅读(138)
评论(0)
推荐(0)
摘要：
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2016-12-30 17:54
Hutonm
阅读(133)
评论(0)
推荐(0)
摘要：
Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a g 阅读全文
posted @ 2016-12-30 17:53
Hutonm
阅读(166)
评论(0)
推荐(0)
摘要：
The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, calcul 阅读全文
posted @ 2016-12-30 14:09
Hutonm
阅读(151)
评论(0)
推荐(0)
摘要：
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/ve 阅读全文
posted @ 2016-12-30 13:33
Hutonm
阅读(125)
评论(0)
推荐(0)
浙公网安备 33010602011771号