摘要: https://leetcode.com/problems/longest-common-prefix/description/ Write a function to find the longest common prefix string amongst an array of strings 阅读全文
posted @ 2017-11-08 20:36 hozhangel 阅读(185) 评论(0) 推荐(0)
摘要: Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. leetcode上已有的解决方法: 1、https://leetcode.com/p 阅读全文
posted @ 2017-11-08 20:06 hozhangel 阅读(115) 评论(0) 推荐(0)
摘要: Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 罗马数字: 基本字符 I V X L C D M 相应的阿拉伯数字表示为 1 5 1 阅读全文
posted @ 2017-11-08 19:21 hozhangel 阅读(271) 评论(0) 推荐(0)
摘要: 2017-11-07 21:58:22 https://leetcode.com/problems/container-with-most-water/description/ Given n non-negative integers a1, a2, ..., an, where each rep 阅读全文
posted @ 2017-11-08 18:52 hozhangel 阅读(195) 评论(0) 推荐(0)