- 第155题(简单): 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. 将元素x推入栈中
pop() – Removes the element on top of the stack. 删除栈顶的元素
top() – Get the top element. 获取栈顶的元素
getMin() – Retrieve the minimum element in the stack. 检索栈中的最小元素
例子:Example:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> Returns -3.
minStack.pop();
minStack.top(); --> Returns 0.
minStack.getMin(); --> Returns -2.
主要思路:设立两个栈,其中一个存放最小值
class MinStack(object):
def __init__(self):
"""
initialize your data structure here.
"""
self.stack = []
self.minStack = []
def push(self, x):
"""
:type x: int
:rtype: None
"""
self.stack.append(x)
if len(self.minStack) == 0 or x <= self.minStack[-1]:
self.minStack.append(x)
def pop(self):
"""
:rtype: None
"""
p = self.stack.pop()
if p == self.minStack[-1]:
self.minStack.pop()
def top(self):
"""
:rtype: int
"""
return self.stack[-1]
def getMin(self):
"""
:rtype: int
"""
return self.minStack[-1]
- 第167题(简单):Two Sum II - 数组已经排好序 (I是算法的第一题)
给定一个已经排好序(升序)的整数数组和一个目标值,找出数组中和为目标值的两个数的索引。
注意:
(1) index不能从0开始 (要从1开始)
(2) 你可以假设每个输入只对应一种答案,且同样的元素不能被重复利用。
有两种解法:
1.和 Two Sum I 几乎一摸一样
2.采用左右两边逼近的方式
Example:
Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
代码:
##第一种解法
class Solution1(object):
def twoSum1(self, numbers, target):
"""
:type numbers: List[int]
:type target: int
:rtype: List[int]
"""
dict = {} # key是值,value是该值的索引