最新 最热

单调栈结构 && 84. Largest Rectangle in Histogram&&最大子矩阵的大小

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

2019-02-25
1

leetcode 67 Add Binary

Add Binary Total Accepted: 46815 Total Submissions: 189215 My Submissions

2019-01-18
0

leetcode 102 Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

2019-01-18
1

LeetCode 109 Convert Sorted List to Binary Search Tree

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is...

2018-07-04
0

LeetCode 108 Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as ...

2018-07-04
0

leetcode-476-Number Complement

题目描述:Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note:The given integer ...

2018-05-22
0

leetcode-762-Prime Number of Set Bits in Binary Representation

题目描述:Given two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime number of set bits in their binary representation.(R...

2018-05-21
0

leetcode-832-Flipping an Image

题目描述:Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image.To flip an image horizontally means that ...

2018-05-21
0

226 Invert Binary Tree

/** * Definition for a binary tree node. * function TreeNode(val) { * this.val = val; * this.left = this.right = null; * } *//** * @param {TreeN...

2018-04-18
0

Leetcode 95 Unique Binary Search Trees II

Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n = 3, your program should retur...

2018-01-12
1