2015 年 6月 10 日随笔档案 - 聆听V风声

[leetcode 13]Roman to integer

摘要： 1 题目：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.2 思路和上一道反过来，好吧，但是思路不一样。我写的代码思路一样，要考虑一些特... 阅读全文

posted @ 2015-06-10 20:27 聆听V风声阅读(152) 评论(0) 推荐(0)

[leetcode 12] Inter to Roman

摘要： 1 题目：Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Hide TagsMathString2 思路：经过我仔细研读维基百科的说明h... 阅读全文

posted @ 2015-06-10 18:47 聆听V风声阅读(250) 评论(0) 推荐(0)

[leetcode 11]Container With Most Water

摘要： 1 题目：Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoint... 阅读全文

posted @ 2015-06-10 16:22 聆听V风声阅读(171) 评论(0) 推荐(0)

[eetcode 10]Regular Expression Matching

摘要： 1 题目：Implement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more of the preceding elemen... 阅读全文

posted @ 2015-06-10 11:56 聆听V风声阅读(789) 评论(0) 推荐(0)

导航

2015年6月10日