LeetCode题解
文章平均质量分 82
我自己做LeetCode时保存下来的题解,尽可能详细地解释每一个算法,对多种解答给出不同复杂度的分析
洗来洗麻衣
努力努力!钢巴洛!
展开
-
leetcode-6. ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I原创 2016-09-09 17:14:30 · 381 阅读 · 0 评论 -
leetcode-17. Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st原创 2016-09-09 17:43:07 · 405 阅读 · 0 评论 -
leetcode-51. 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, return all distinct solutions to the n-queens puzzle.原创 2016-09-09 15:30:36 · 389 阅读 · 0 评论 -
leetcode-52. N-Queens II
Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.题意解析:好吧这题和N-Queens一样,甚至还简单了,思路可以参考我之前写的这篇博客leetcode-51. N-Que原创 2016-09-09 17:05:59 · 359 阅读 · 0 评论 -
leetcode-66. Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.题意解析:这题就是给你一个数字,原创 2016-09-02 00:34:46 · 295 阅读 · 0 评论 -
leetcode-122. Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on原创 2016-08-30 22:59:17 · 287 阅读 · 0 评论 -
leetcode-134. Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to原创 2016-08-29 20:05:04 · 447 阅读 · 0 评论 -
leetcode-135. Candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on原创 2016-08-29 21:43:29 · 412 阅读 · 0 评论 -
leetcode-207. Course Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as原创 2016-08-30 23:15:52 · 308 阅读 · 0 评论 -
leetcode-310. Minimum Height Trees
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called mini原创 2016-08-31 21:26:45 · 353 阅读 · 0 评论