"Leetcode-Interview algorithm classic-java Implementation" "All topic Directory Index" __ code

"The total directory of Bowen >>>" Leetcode algorithm title

Leetcode is a very useful site to prepare for the interview, is very worthwhile to go to the place, which are some of the classic face questions, these topics in the Google,microsoft,facebook,yahoo and other large Internet companies interview questions have appeared, and the topic is divided into easy, Difficult third, but also according to the topic of classification, when the problem can be done according to their own preferences. I am now doing exercises on the Leetcode, and will do the process of recording down for their later review and everyone to learn,This blog is I do the total list of questions, I will continue to update, you are welcome to pay attention to, if there is any shortage of places also please do not hesitate to point out, what good ideas and suggestions can also be discussed together.
I have all the blog welcome reprint, reprint please indicate the source.All code Downloads "Https://github.com/Wang-Jun-Chao/leetcode" Directory 第001-020 Problem "001-two Sum (for two numbers)" "002-add two Numbers (add two numbers represented by a single list)" "003-longest Substring without repeating Characters (longest non-repeating substring)" "004-median of two Sorted Arrays (median number of two sorted arrays)" "005-longest palindromic Substring (Longest palindrome string)" "006-zigzag conversion (Z-font conversion)" "007-reverse integer (flip int)" "008-string to Integer (atoi) (String to Integer)" "009-palindrome number (palindrome)" "010-regular expresssion Matching (regular expression match)" "011-containerwithmostwater (holds the most water)" "012-integer to Roman (digital to Roman characters)" "013-roman to Integer (Roman numeral to Integer)" "014-longest Common Prefix (maximum public prefix)" "015-3 Sum (three number and)" "016-3 Sum closest (nearest three digits)" "017-letter combinations of a phone number (combination of words on the phone)" "018-4sum (four-digit and)" "019-remove nth node from end of list (remove the reciprocal nth node of a single list)" "020-valid parentheses (bracket validation)" 第021-040 Problem "021-merge two Sorted Lists (merging two sorted single linked lists)" "022-generate parentheses (Generate parentheses)" "023-merge K Sorted Lists (combined K-lined single linked list)" "024-swap Nodes in pairs (pair Exchange single linked list node)" "025-reverse Nodes in K-group (a group of K nodes in a single linked list to reverse)" "026-remove duplicates from Sorted Array (delete duplicate elements in sorted array)" "027-remove Element (delete elements in an array)" "028-implement strstr () (Implement STRSTR () function)" "029-divide two integers (two integer)" "030-substring with concatenation of all Words (concatenation of all words)" [] ("") "032-longest Valid parentheses (maximum effective bracket)" "033-search in rotated Sorted array (searching in a rotating array)" "034-search for a range (search for a range)" "035-search Insert Position (search Insert location)" "036-valid Sudoku (Verified sudoku)" [] ("") "038-count and Say (counting and expression)" [] ("") [] ("") 第041-060 Problem [] ("") [] ("") [] ("") [] ("") [] ("") "046-permutations (order)" [] ("") [] ("") [] ("") "050-implement Pow (x, N) (n-th) for X" [] ("") [] ("") "053-maximum subarray (maximum sub array and)" "054-spiral matrix (spiral matrices)" [] ("") "056-merge intervals (interval merge)" "057-insert Interval (insertion interval)" "058-length of last word (length of final word)" "059-spiral Matrix II (helical matrices II)" [] ("") 第061-080 Problem "061-rotate list (rotating single linked list)" "062-unique Paths (unique path)" "063-unique Paths II (unique path Problem II)" "064-minimum path Sum (min path and)" [] ("") "066-plus One (plus)" "067-add Binary (binary addition)" [] ("") [] ("") "070-set Matrix zeroes (matrices 0)" [] ("") [] ("") "073-climbing Stairs (stair climbing)" "074-search a 2D matrix (search for two-dimensional matrices)" "075-sort Colors (color sort)" [] ("") "077-combinations (number of combinations)" "078-subsets (subset)" "079-word search (Word searching)" [] ("") 第081-100 Problem [] ("") "081-search in rotated Sorted array II (search for rotated sorted array)" "082-remove duplicates from Sorted List II (delete duplicate element II in sorted list)" "083-remove duplicates from Sorted list (delete duplicate nodes in sorted single linked list)" [] ("") [] ("") "086-partition list (partitioned by single linked list)" "088-merge Sorted Array (merge sorted arrays)" 089-gray Code (gray code) [] ("") [] ("") "092-reverse linked List II (Inverted single link list ii)" "094-binary tree inorder Traversal (sequence traversal in binary trees)" [] ("") "096-unique Binary search trees (only two-fork searching tree)" [] ("") [] ("") "098-validate Binary search tree (validation of binary searching trees)" [] ("") "100-same tree (two trees are the same)" 第101-120 Problem "101-symmetric tree (Symmetrical trees)" "102-binary Tree Levels Order traversal (cross-sequence traversal)" "103-binary trees zigzag Level order traversal (binary tree Hierarchical zigzag traversal)" "104-maximum Depth of Binary tree (maximum depth of binary trees)" "105-construct Binary tree from preorder and inorder traversal (constructed two-forked trees by sequence and sequence traversal)" "106-construct Binary trees from Inorder and postorder traversal (by the sequence and subsequent traversal construction of the two-forked tree)" "107-binary trees Level Order Traversal II (binary tree Sequence Traversal II)" "108-convert Sorted array to Binary Search trees (sorted array to balanced binary tree)" "109-convert Sorted list to Binary Search trees (sorted list converted into binary sort tree)" "110-balanced Binary tree (balanced binary trees)" "111-minimum Depth of Binary trees (minimum depth of binary tree)" "112-path Sum (Path and)" "113-path Sum II (Path and II)" "114-flatten Binary trees to Linked list (binary tree turn single linked list)" [] ("") "116-populating Next right pointers at each Node (binary tree link)" "117-populating Next right pointers at each Node (binary tree link right-hand pointer ii)" "118-pascal ' s triangle (Pascal Triangle (Yang Hui's triangle))" "119-pascal ' s Triangle II (Pascal triangle (Yang Hui's Triangle) II)" "120-triangle (triangle)" 第121-140 Problem "121-best time to purchase and Sell stock (Best Buy and sell)" [] ("") [] ("") [] ("") "125-valid palindrome (back to text validation)" [] ("") [] ("") [] ("") "129-sum root to leaf Numbers (added to the numbers of all roots to leaf node groups)" "130-surrounded regions (surround area)" [] ("") [] ("") [] ("") "134-gas Station (gas station problem) [] ("") "136-single number (numbers that appear only once)" "137-single Number II (only one digit II)" "138-copy list with Random pointer (single linked list with random pointers copied)" "139-word break (Word split)" [] ("") 第141-160 Problem "141-linked list Cycle (with rings in a single list)" "142-linked list Cycle II (with Ring II in single linked list)" "143-copy list with Random pointer (linked list with random pointer replication)" "144-binary Tree Preorder Traversal (non-recursive forward traversal of binary trees)" "145-binary Tree postorder Traversal (binary trees not recursive subsequent traversal)" [] ("") "147-insertion sort List (linked list insertion sort)" [] ("") [] ("") [] ("") "150-evaluate Reverse Polish notation (calculate inverse polish)" "151-reverse Words in a string (reverse word in string)" "152-maximum product Subarray (maximum product of a child array)" "153-find Minimum in rotated Sorted array (find the smallest number in the rotating array)" "154-find Minimum in rotated Sorted Array II (find the smallest number II in a rotating array)" "155-min stack (minimum stack)" [] ("") [] ("") [] ("") "160-intersection of two linked Lists (intersection of single linked lists)" 第161-180 Problem [] ("") [] ("") [] ("") [] ("") "165-compare version Numbers (compare versions number)" [] ("") [] ("") "168-excel Sheet column title (excell)" "169-majority Element (primary)" [] ("") "171-excel Sheet column number (Excel table row numbers)" "172-factorial trailing zeroes (number of 0 after factorial tail)" [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") 第181-200 Problem [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") "189-rotate Array (rotated array)" "190-reverse Bits (Reverse two system)" [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") "198-house Robber (Robber)" "199-binary Tree Right Side view (look at the two fork trees from the right-hand side) 第201-220 Problem "200-number of Islands (number of islands)" "201-bitwise and of Numbers range (range digits and results)" "202-happy number (Happy numbers)" "203-remove linked list Elements (delete elements from a single list)" "204-count Primes (statistic prime numbers)" "205-isomorphic Strings (Isomorphic string)" "206-reverse linked list (reverse a single linked list)" [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") "215-kth largest Element in an array (number k in the array)" "216-combination Sum III (number of combinations)" "217-contains Duplicate (contains duplicate elements)" [] ("") "219-contains Duplicate II (contains duplicate elements II)" [] ("") 第221-240 Problem [] ("") [] ("") "223-rectangle Area (rectangular region)" [] ("") "225-implement stack using queues (stack operations with queues)" [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") 第241-260 Problem [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") 第261-280 Problem [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") [] ("") 第281-300 Problem [] ("") [