leetcode
Unique-You
这个作者很懒,什么都没留下…
展开
-
leetcode---Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get原创 2017-12-09 10:03:07 · 197 阅读 · 0 评论 -
leetcode---TwoSum
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the sam原创 2017-12-09 11:13:40 · 245 阅读 · 0 评论