题目描述：
Implement the following operations of a stack using queues.
push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
empty() -- Return whether the stack is empty.
Notes:
You ...
归档 2015
[LeetCode]Implement Stack using Queues
[LeetCode]Basic Calculator
作者是
发布于
在
LeetCode.
题目描述：
Implement a basic calculator to evaluate a simple expression string.
The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty spaces .
You may assume that the given expression is always valid ...
[LeetCode]Rectangle Area
作者是
发布于
在
LeetCode.
题目描述：
Find the total area covered by two rectilinear rectangles in a 2D plane.
Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.
![[LeetCode]Rectangle Area](https://leetcode.com/static/images/problemset/rectangle_area.png)
Assume that the total area is never beyond ...
[LeetCode]Count Complete Tree Nodes
作者是
发布于
在
LeetCode.
题目描述：
Given a complete binary tree, count the number of nodes.
Definition of a complete binary tree from Wikipedia:
In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level ...
[LeetCode]Contains Duplicate III
作者是
发布于
在
LeetCode.
题目描述：
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and ...