Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.以下为补充知识,百度到的罗马数字写法:个位数举例I, 1 】II, 2】 III, 3】... Read More
posted @ 2014-07-21 22:26
Xylophone
Views(149)
Comments(0)
Diggs(0)
Implement int sqrt(int x).Compute and return the square root of x.百度百科里,牛顿迭代解释:http://baike.baidu.com/view/643093.htm?fr=aladdin已经证明,如果是连续的,并且待求的零点是孤立... Read More
posted @ 2014-07-21 21:47
Xylophone
Views(131)
Comments(0)
Diggs(0)
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist... Read More
posted @ 2014-07-21 12:03
Xylophone
Views(125)
Comments(0)
Diggs(0)

浙公网安备 33010602011771号