刷题 - 分类 - mianhk's noteshttp://yuguocong.cn/categories/%E5%88%B7%E9%A2%98/刷题 - 分类 - mianhk's notesHugo -- gohugo.iozh-CNgcyu25@gmail.com (mianhk)gcyu25@gmail.com (mianhk)Wed, 20 Jun 2018 21:40:02 +0800剑指offer-刷题总结http://yuguocong.cn/posts/algorithm/re_sword_to_offer/Wed, 20 Jun 2018 21:40:02 +0800作者http://yuguocong.cn/posts/algorithm/re_sword_to_offer/

重刷剑指offer总结

]]>LeetCode-60-Permutation-Sequencehttp://yuguocong.cn/posts/algorithm/leetcode-60-permutation-sequence/Tue, 06 Feb 2018 17:32:24 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-60-permutation-sequence/LeetCode-56and57-Merge-Intervalshttp://yuguocong.cn/posts/algorithm/leetcode-56-merge-intervals/Tue, 30 Jan 2018 16:00:00 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-56-merge-intervals/LeetCode-56-Merge-Intervals Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. 如例子中所示，每个数组的前后分别表示开始和结束，工作是合并有重叠的数组。例如，由于[1,3]和[2,6]有重LeetCode-55-Jump-Gamehttp://yuguocong.cn/posts/algorithm/leetcode-55-jump-game/Tue, 30 Jan 2018 15:39:55 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-55-jump-game/LeetCode-55-Jump-Game Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. For example: A = [2,3,1,1,4], return true. A = [3,2,1,0,4], return false. 由题可知，数组的位置表示从该位置可LeetCode-53-Maximum-Subarrayhttp://yuguocong.cn/posts/algorithm/leetcode-53-maximum-subarray/Fri, 26 Jan 2018 17:57:03 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-53-maximum-subarray/LeetCode-53-Maximum-Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the largest sum = 6. 最长子序列，又是一个动态规划的问题，关于动态规划，我们最主要的是要维护DLeetCode-52-N-Queens-IIhttp://yuguocong.cn/posts/algorithm/leetcode-52-n-queens-ii/Fri, 26 Jan 2018 17:00:24 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-52-n-queens-ii/LeetCode-52-N-Queens-II Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions. 只返回N皇后问题结果的种数。 因此不需要每一个字符串置位了，只需要判断一个位置的横竖，斜45度和斜135度LeetCode-51-N-Queenshttp://yuguocong.cn/posts/algorithm/leetcode-51-n-queens/Fri, 26 Jan 2018 10:12:49 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-51-n-queens/LeetCode-51-N-Queens 经典的N皇后问题，重点是全排列的问题，但是这里由于N皇后的不重复行、列、斜的要求，在排列的过程中，比如从行开始排列，只能保证同行不重复，所LeetCode-49-Group-Anagramshttp://yuguocong.cn/posts/algorithm/leetcode-49-group-anagrams/Thu, 25 Jan 2018 21:44:37 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-49-group-anagrams/Leetcode-48-Rotate-Imagehttp://yuguocong.cn/posts/algorithm/leetcode-48-rotate-image/Thu, 25 Jan 2018 20:44:32 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-48-rotate-image/Leetcode-48-Rotate-Image ou are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation. Example : Given input matrix = [ [1,2,3], [4,5,6], [7,8,9] ], rotate the input matrix in-place such that it becomes: [LeetCode-36-Valid-Sudokuhttp://yuguocong.cn/posts/algorithm/leetcode-36-valid-sudoku/Sun, 14 Jan 2018 21:53:42 +0800作者http://yuguocong.cn/posts/algorithm/leetcode-36-valid-sudoku/LeetCode-36-Valid-Sudoku Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’. 判断一个二维数组是不是数独数组。要求是：同行同列，斜对角不能有相同的数组，这里需