weixin_32135877的博客

[leetcode]695. Max Area of IslandAnalysis 周五~—— [ummmm~]Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizonta...

[leetcode]886. Possible BipartitionAnalysisStill raining outside…—— [每天刷题并不难0.0]Given a set of N people (numbered 1, 2, …, N), we would like to split everyone into two groups of any size.Each ...

[leetcode]240. Search a 2D Matrix IIAnalysisraining outside…—— [每天刷题并不难0.0]Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:...

[leetcode]129. Sum Root to Leaf NumbersAnalysis还没工作就想退休—— [每天刷题并不难0.0]Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the roo...

[leetcode]491. Increasing SubsequencesAnalysis放假回家效率果然打折—— [每天刷题并不难0.0]Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and th...

[leetcode]934. Shortest BridgeAnalysis2019要开心鸭—— [每天刷题并不难0.0]In a given 2D binary array A, there are two islands. (An island is a 4-directionally connected group of 1s not connected to any oth...

[leetcode]863. All Nodes Distance K in Binary TreeAnalysisnormal day—— [每天刷题并不难0.0]We are given a binary tree (with root node root), a target node, and an integer value K.Return a list of the ...

[leetcode]337. House Robber IIIAnalysisfighting!!!—— [每天刷题并不难0.0]The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besi...

[leetcode]638. Shopping OffersAnalysisfighting!!!—— [每天刷题并不难0.0]In LeetCode Store, there are some kinds of items to sell. Each item has a price.However, there are some special offers, and a sp...

[leetcode]419. Battleships in a BoardAnalysis 周四不知道快不快乐—— [有点想回家过暑假的冲动！]Given an 2D board, count how many battleships are in it. The battleships are represented with ‘X’s, empty slots are ...

[leetcode]797. All Paths From Source to TargetAnalysis 周四不知道快不快乐—— [有点想回家过暑假的冲动！]Given a directed, acyclic graph of N nodes. Find all possible paths from node 0 to node N-1, and return th...

[leetcode]841. Keys and RoomsAnalysis 中午吃啥？—— [啊啊啊啊 paper结果真的要出来了，心塞]There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, …, N-1, and each room may have...

[leetcode]662. Maximum Width of Binary TreeAnalysisHappy girls day—— [每天刷题并不难0.0]Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the max...