Given a 2D board containing'X'and'O'(the letter O), capture all regions surrounded by'X...
![240](https://cdn2.jianshu.io/assets/default_avatar/13-394c31a9cb492fcb39c27422ca7d2815.jpg?imageMogr2/auto-orient/strip|imageView2/1/w/240/h/240)
Given a 2D board containing'X'and'O'(the letter O), capture all regions surrounded by'X...
Given a binary tree containing digits from0-9only, each root-to-leaf path could represe...
Given two words (beginWordandendWord), and a dictionary's word list, find the length of...
Given a string, determine if it is a palindrome, considering only alphanumeric characte...
Say you have an array for which theithelement is the price of a given stock on dayi. De...
Say you have an array for which theithelement is the price of a given stock on dayi. De...
Say you have an array for which theithelement is the price of a given stock on dayi. If...
Given a triangle, find the minimum path sum from top to bottom. Each step you may move ...
一.SonarQube简介 SonarQube是一款用于代码质量管理的开源工具,它主要用于管理源代码的质量。 通过插件形式,可以支持众多计算机语言,比如 java, C#, ...
Given a non-negativeindexkwherek≤33, return thekthindex row of the Pascal's triangle. N...
Given a non-negative integernumRows, generate the firstnumRowsof Pascal's triangle. 杨辉三...
Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } P...
You are given aperfect binary treewhereall leaves are on the same level, and every pare...
Given a binary tree, flatten it to a linked list in-place. For example, given the follo...
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals...
1、二分查找 二分查找思想简单,但是在实现时有一些需要注意的细节: 1、在计算 mid 时不能使用 mid = (l + h) / 2 这种方式,因为 l + h 可能会导致...
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that ...
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes a...
Given a binary tree, determine if it is height-balanced. For this problem, a height-bal...