摘要：
Given a positive integer, return its corresponding column title as appear in an Excel sheet. For example: 阅读全文
posted @ 2017-11-23 08:20
逸朵
阅读(133)
评论(0)
推荐(0)
摘要：
Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0. You may assum 阅读全文
posted @ 2017-11-23 08:08
逸朵
阅读(152)
评论(0)
推荐(0)
摘要：
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Remov 阅读全文
posted @ 2017-11-23 05:26
逸朵
阅读(102)
评论(0)
推荐(0)
摘要：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find 阅读全文
posted @ 2017-11-23 04:59
逸朵
阅读(137)
评论(0)
推荐(0)
摘要：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find 阅读全文
posted @ 2017-11-23 04:54
逸朵
阅读(136)
评论(0)
推荐(0)
摘要：
Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4],t 阅读全文
posted @ 2017-11-23 04:35
逸朵
阅读(97)
评论(0)
推荐(0)
摘要：
Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another e 阅读全文
posted @ 2017-11-23 04:17
逸朵
阅读(121)
评论(0)
推荐(0)
摘要：
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) - Get the 阅读全文
posted @ 2017-11-23 02:49
逸朵
阅读(129)
评论(0)
推荐(0)
摘要：
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up:Can you 阅读全文
posted @ 2017-11-23 02:00
逸朵
阅读(116)
评论(0)
推荐(0)
浙公网安备 33010602011771号