Tag Archives: Stack

Remove K Digits
Leave a commentJune 25, 2017 by oneOokay
Given a nonnegative integer num represented as a string, remove k digits from the number so that the new number …
Continue reading 
Next Greater Element II
Leave a commentJune 21, 2017 by oneOokay
Given a circular array (the next element of the last element is the first element of the array), print the …
Continue reading 
三个点的位置.Graham scan.Convex Hull
Leave a commentJune 18, 2017 by oneOokay
解决的是几何问题… 两条直线是否相交 二维数组标示x,y的点的集合, Find simple closed path. 就是点集外檐的一个轮廓.(connect the dots without crossing) 同样点的集合,求形成一个凸包的边缘点的集合. Orientation of 3 ordered points http://www.geeksforgeeks.org/orientation3orderedpoints/ 给3个点,判断这三个点的相对位置. …
Continue reading 
Course Schedule I II
Leave a commentDecember 19, 2016 by oneOokay
There are a total of n courses you have to take, labeled from 0 to n – 1. Some courses …
Continue reading 
Validate Binary Search Tree
Leave a commentNovember 30, 2016 by oneOokay
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as …
Continue reading 
Min Stack
Leave a commentNovember 20, 2016 by oneOokay
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) — Push element …
Continue reading 
Using Inorder traversal in BST
Leave a commentNovember 6, 2016 by oneOokay
Inorder traversal: Recursive & 分治 可以用Inorder traversal来解决以下这两个问题： Kth Smallest Element in a BST Inorder Iterative Inorder Recursive DFS Validate Binary …
Continue reading