摘要:
Problem:Given a range [m, n] where 0 00111010101011...We can we reach the '1' in high index, all digits behind after it must change once. That's to s... 阅读全文
摘要:
Problem:Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive... 阅读全文
摘要:
Problem:Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Analysis:This problem is trivial, if... 阅读全文
摘要:
Problem:Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Analysis:This problem actually requi... 阅读全文