[LeetCode] Integer to Roman 解题报告

摘要： Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.» Solve this problem[解题思路]这道题主要就在于如何处理每一位dig... 阅读全文
posted @ 2012-12-23 13:36 小刀初试 阅读(118) 评论(0) 推荐(0)

[LeetCode] Insert Interval 解题报告

摘要： Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initial... 阅读全文
posted @ 2012-12-23 12:32 小刀初试 阅读(184) 评论(0) 推荐(0)

[LeetCode] Implement strStr() 解题报告

摘要： Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.» Solve this problem[解题思... 阅读全文
posted @ 2012-12-23 11:14 小刀初试 阅读(145) 评论(0) 推荐(0)

[LeetCode] Gray Code 解题报告

摘要： The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total numb... 阅读全文
posted @ 2012-12-23 06:37 小刀初试 阅读(177) 评论(0) 推荐(0)
点击右上角即可分享
微信分享提示