155. Min Stack
155. Min Stack Description 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 the top element. getMin() – Retrieve the minimum element in the stack.
Read more154. Find Minimum in Rotated Sorted Array II
154. Find Minimum in Rotated Sorted Array II Description 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 the minimum element.
Read more153. Find Minimum in Rotated Sorted Array
153. Find Minimum in Rotated Sorted Array Description 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 the minimum element.
Read more152. Maximum Product Subarray
152. Maximum Product Subarray Description Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.
Read more150. Evaluate Reverse Polish Notation
150. Evaluate Reverse Polish Notation Description Evaluate the value of an arithmetic expression in Reverse Polish Notation(or 逆波兰表达式).
Read more149. Max Points on a Line
149. Max Points on a Line Description Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
Read more145. Binary Tree Postorder Traversal
145. Binary Tree Postorder Traversal Description Given a binary tree, return the postorder traversal of its nodes’ values.
Read more
147. Insertion Sort List
147. Insertion Sort List Description Sort a linked list using insertion sort.
Read more144. Binary Tree Preorder Traversal
144. Binary Tree Preorder Traversal Description Given a binary tree, return the preorder traversal of its nodes’ values.
Read more143. Reorder List
143. Reorder List Description Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
Read more