原创 406. Queue Reconstruction by Height
Description height of the person and k is the number of people in front of this person who have a height greater tha
原创 22. Generate Parentheses
Description: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
原创 684. Redundant Connection
Description: In this problem, a tree is an undirected graph that is connected and has no cycles. The given input is a
原创 621. Task Scheduler
Description: Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different
原创 207. Course Schedule
Description: There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prereq
原创 62. Unique Paths
Description: A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The rob
原创 210. Course Schedule II
Description: There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prereq
原创 32. Longest Valid Parentheses
Description: Given a string containing just the characters '(' and ')', find the length of the longest valid (well-f