James Pan

原题网址：https://leetcode.com/problems/meeting-rooms/Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend

原题网址：https://leetcode.com/problems/n-queens-ii/Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.方法一：深度优先搜索，使用一

原题网址：https://leetcode.com/problems/meeting-rooms-ii/Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of confe

原题网址：https://leetcode.com/problems/n-queens/The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, retu

原题网址：https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the st