無名黑洞

Leetcode全树类问题。算法总的来说就是递归(Stack, DFS)和广度优先(Queue, BFS)两种。下面有关二叉树类linked list的题目，若不加特别说明...

目录 1、编号3 Longest Substring Without Repeating Characters 2、编号6 ZigZag Conversion 3、编号20 Valid Parentheses 4、编号28 Implement strStr() 5、编号31 Longest Valid Parentheses 6、编号42 Multiply String

目录： 1、编号5 5_Longest Palindromic Substring 2、编号9 Palindrome Number 3、编号126 Valid Palindrome 4、编号132 Palindrome Partitioning (DFS) 5、编号133 Palindrome Partitioning II (DP) 1、编号5 5_Longest Pal

目录 1、编号11 Regular Expression Matching 2、编号29 Substring with Concatenation of All Words 3、编号43 Wildcard Matching 4、编号79 Word Search 1、编号11 Regular Expression Matching 2、编号29 Substri

目录 1、编号30 Next Permutation 2、编号44 Permutations 3、编号45 Permutations II 4、编号60 Permutation Sequence 1、编号30 Next Permutation Implement next permutation, which rearranges numbers into the lexicogr

目录 1、编号1 Two Sum Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they

目录 1、编号34 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

目录 1、编号7 Reverse digits of an integer. 2、编号8 Stringto Integer ATOI 3、编号10 Container With Most Water 4、编号12 Integer To Roman 5、编号13 Roman To Integer 6、编号27 Divide Two Integers 7、编号37 Count and S

目录 1、编号17 Letter Combinations Of 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

目录 1、编号2 Median of Two Sorted Arrays There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be

目录 如果没有特殊说明，各题使用的链表数据结构如下： /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ 1、编号4

目录 1、编号48 Rotate Image You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 可以硬算转了九十度后的目标矩阵和原矩阵各元素的