摘要: Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999. 阅读全文
posted @ 2015-12-03 22:00 code_yang 阅读(163) 评论(0) 推荐(0)
摘要: 今天刚刚开通了博客,以后会把每天刷的leetcode代码写在上面。加油,为了一年后的校园招聘! 阅读全文
posted @ 2015-12-03 20:37 code_yang 阅读(142) 评论(0) 推荐(0)
摘要: Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa... 阅读全文
posted @ 2015-12-03 20:28 code_yang 阅读(104) 评论(0) 推荐(0)