摘要：#题目简述：Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Ge... 阅读全文

摘要：#题目描述：Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two... 阅读全文

摘要：#题目描述：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.#解题思路：首先我们要了解罗马数字怎么写的个位数举例I, 1 】II, 2】... 阅读全文

摘要：#题目简述：Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest for... 阅读全文