From 8872fc1858f38bc84053ab450d019df52f48748c Mon Sep 17 00:00:00 2001 From: yanglbme Date: Wed, 22 Jul 2020 17:33:42 +0800 Subject: [PATCH] docs: update README.md --- solution/0000-0099/0001.Two Sum/README.md | 2 ++ solution/0000-0099/0001.Two Sum/README_EN.md | 2 ++ .../0000-0099/0002.Add Two Numbers/README.md | 2 ++ .../0002.Add Two Numbers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0006.ZigZag Conversion/README.md | 2 ++ .../0006.ZigZag Conversion/README_EN.md | 2 ++ .../0000-0099/0007.Reverse Integer/README.md | 2 ++ .../0007.Reverse Integer/README_EN.md | 2 ++ .../0008.String to Integer (atoi)/README.md | 2 ++ .../README_EN.md | 2 ++ .../0009.Palindrome Number/README.md | 2 ++ .../0009.Palindrome Number/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0011.Container With Most Water/README.md | 2 ++ .../README_EN.md | 2 ++ .../0000-0099/0012.Integer to Roman/README.md | 2 ++ .../0012.Integer to Roman/README_EN.md | 2 ++ .../0000-0099/0013.Roman to Integer/README.md | 2 ++ .../0013.Roman to Integer/README_EN.md | 2 ++ .../0014.Longest Common Prefix/README.md | 2 ++ .../0014.Longest Common Prefix/README_EN.md | 2 ++ solution/0000-0099/0015.3Sum/README.md | 2 ++ solution/0000-0099/0015.3Sum/README_EN.md | 2 ++ .../0000-0099/0016.3Sum Closest/README.md | 2 ++ .../0000-0099/0016.3Sum Closest/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0000-0099/0018.4Sum/README.md | 2 ++ solution/0000-0099/0018.4Sum/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0020.Valid Parentheses/README.md | 2 ++ .../0020.Valid Parentheses/README_EN.md | 2 ++ .../0021.Merge Two Sorted Lists/README.md | 2 ++ .../0021.Merge Two Sorted Lists/README_EN.md | 2 ++ .../0022.Generate Parentheses/README.md | 2 ++ .../0022.Generate Parentheses/README_EN.md | 2 ++ .../0023.Merge k Sorted Lists/README.md | 2 ++ .../0023.Merge k Sorted Lists/README_EN.md | 2 ++ .../0024.Swap Nodes in Pairs/README.md | 2 ++ .../0024.Swap Nodes in Pairs/README_EN.md | 2 ++ .../0025.Reverse Nodes in k-Group/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0000-0099/0027.Remove Element/README.md | 2 ++ .../0027.Remove Element/README_EN.md | 2 ++ .../0028.Implement strStr()/README.md | 2 ++ .../0028.Implement strStr()/README_EN.md | 2 ++ .../0029.Divide Two Integers/README.md | 2 ++ .../0029.Divide Two Integers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0000-0099/0031.Next Permutation/README.md | 2 ++ .../0031.Next Permutation/README_EN.md | 2 ++ .../0032.Longest Valid Parentheses/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0035.Search Insert Position/README.md | 2 ++ .../0035.Search Insert Position/README_EN.md | 2 ++ .../0000-0099/0036.Valid Sudoku/README.md | 2 ++ .../0000-0099/0036.Valid Sudoku/README_EN.md | 2 ++ .../0000-0099/0037.Sudoku Solver/README.md | 2 ++ .../0000-0099/0037.Sudoku Solver/README_EN.md | 2 ++ .../0000-0099/0038.Count and Say/README.md | 2 ++ .../0000-0099/0038.Count and Say/README_EN.md | 2 ++ .../0000-0099/0039.Combination Sum/README.md | 2 ++ .../0039.Combination Sum/README_EN.md | 2 ++ .../0040.Combination Sum II/README.md | 2 ++ .../0040.Combination Sum II/README_EN.md | 2 ++ .../0041.First Missing Positive/README.md | 2 ++ .../0041.First Missing Positive/README_EN.md | 2 ++ .../0042.Trapping Rain Water/README.md | 2 ++ .../0042.Trapping Rain Water/README_EN.md | 2 ++ .../0000-0099/0043.Multiply Strings/README.md | 2 ++ .../0043.Multiply Strings/README_EN.md | 2 ++ .../0044.Wildcard Matching/README.md | 2 ++ .../0044.Wildcard Matching/README_EN.md | 2 ++ .../0000-0099/0045.Jump Game II/README.md | 2 ++ .../0000-0099/0045.Jump Game II/README_EN.md | 2 ++ .../0000-0099/0046.Permutations/README.md | 2 ++ .../0000-0099/0046.Permutations/README_EN.md | 2 ++ .../0000-0099/0047.Permutations II/README.md | 2 ++ .../0047.Permutations II/README_EN.md | 2 ++ .../0000-0099/0048.Rotate Image/README.md | 2 ++ .../0000-0099/0048.Rotate Image/README_EN.md | 2 ++ .../0000-0099/0049.Group Anagrams/README.md | 2 ++ .../0049.Group Anagrams/README_EN.md | 2 ++ solution/0000-0099/0050.Pow(x, n)/README.md | 2 ++ .../0000-0099/0050.Pow(x, n)/README_EN.md | 2 ++ solution/0000-0099/0051.N-Queens/README.md | 2 ++ solution/0000-0099/0051.N-Queens/README_EN.md | 2 ++ solution/0000-0099/0052.N-Queens II/README.md | 2 ++ .../0000-0099/0052.N-Queens II/README_EN.md | 2 ++ .../0000-0099/0053.Maximum Subarray/README.md | 2 ++ .../0053.Maximum Subarray/README_EN.md | 2 ++ .../0000-0099/0054.Spiral Matrix/README.md | 2 ++ .../0000-0099/0054.Spiral Matrix/README_EN.md | 2 ++ solution/0000-0099/0055.Jump Game/README.md | 2 ++ .../0000-0099/0055.Jump Game/README_EN.md | 2 ++ .../0000-0099/0056.Merge Intervals/README.md | 2 ++ .../0056.Merge Intervals/README_EN.md | 2 ++ .../0000-0099/0057.Insert Interval/README.md | 2 ++ .../0057.Insert Interval/README_EN.md | 2 ++ .../0058.Length of Last Word/README.md | 2 ++ .../0058.Length of Last Word/README_EN.md | 2 ++ .../0000-0099/0059.Spiral Matrix II/README.md | 2 ++ .../0059.Spiral Matrix II/README_EN.md | 2 ++ .../0060.Permutation Sequence/README.md | 2 ++ .../0060.Permutation Sequence/README_EN.md | 2 ++ solution/0000-0099/0061.Rotate List/README.md | 2 ++ .../0000-0099/0061.Rotate List/README_EN.md | 2 ++ .../0000-0099/0062.Unique Paths/README.md | 2 ++ .../0000-0099/0062.Unique Paths/README_EN.md | 2 ++ .../0000-0099/0063.Unique Paths II/README.md | 2 ++ .../0063.Unique Paths II/README_EN.md | 2 ++ .../0000-0099/0064.Minimum Path Sum/README.md | 2 ++ .../0064.Minimum Path Sum/README_EN.md | 2 ++ .../0000-0099/0065.Valid Number/README.md | 2 ++ .../0000-0099/0065.Valid Number/README_EN.md | 2 ++ solution/0000-0099/0066.Plus One/README.md | 2 ++ solution/0000-0099/0066.Plus One/README_EN.md | 2 ++ solution/0000-0099/0067.Add Binary/README.md | 2 ++ .../0000-0099/0067.Add Binary/README_EN.md | 2 ++ .../0068.Text Justification/README.md | 2 ++ .../0068.Text Justification/README_EN.md | 2 ++ solution/0000-0099/0069.Sqrt(x)/README.md | 2 ++ solution/0000-0099/0069.Sqrt(x)/README_EN.md | 2 ++ .../0000-0099/0070.Climbing Stairs/README.md | 2 ++ .../0070.Climbing Stairs/README_EN.md | 2 ++ .../0000-0099/0071.Simplify Path/README.md | 2 ++ .../0000-0099/0071.Simplify Path/README_EN.md | 2 ++ .../0000-0099/0072.Edit Distance/README.md | 2 ++ .../0000-0099/0072.Edit Distance/README_EN.md | 2 ++ .../0073.Set Matrix Zeroes/README.md | 2 ++ .../0073.Set Matrix Zeroes/README_EN.md | 2 ++ .../0074.Search a 2D Matrix/README.md | 2 ++ .../0074.Search a 2D Matrix/README_EN.md | 2 ++ solution/0000-0099/0075.Sort Colors/README.md | 2 ++ .../0000-0099/0075.Sort Colors/README_EN.md | 2 ++ .../0076.Minimum Window Substring/README.md | 2 ++ .../README_EN.md | 2 ++ .../0000-0099/0077.Combinations/README.md | 2 ++ .../0000-0099/0077.Combinations/README_EN.md | 2 ++ solution/0000-0099/0078.Subsets/README.md | 2 ++ solution/0000-0099/0078.Subsets/README_EN.md | 2 ++ solution/0000-0099/0079.Word Search/README.md | 2 ++ .../0000-0099/0079.Word Search/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0085.Maximal Rectangle/README.md | 2 ++ .../0085.Maximal Rectangle/README_EN.md | 2 ++ .../0000-0099/0086.Partition List/README.md | 2 ++ .../0086.Partition List/README_EN.md | 2 ++ .../0000-0099/0087.Scramble String/README.md | 2 ++ .../0087.Scramble String/README_EN.md | 2 ++ .../0088.Merge Sorted Array/README.md | 2 ++ .../0088.Merge Sorted Array/README_EN.md | 2 ++ solution/0000-0099/0089.Gray Code/README.md | 2 ++ .../0000-0099/0089.Gray Code/README_EN.md | 2 ++ solution/0000-0099/0090.Subsets II/README.md | 2 ++ .../0000-0099/0090.Subsets II/README_EN.md | 2 ++ solution/0000-0099/0091.Decode Ways/README.md | 2 ++ .../0000-0099/0091.Decode Ways/README_EN.md | 2 ++ .../0092.Reverse Linked List II/README.md | 2 ++ .../0092.Reverse Linked List II/README_EN.md | 2 ++ .../0093.Restore IP Addresses/README.md | 2 ++ .../0093.Restore IP Addresses/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0096.Unique Binary Search Trees/README.md | 2 ++ .../README_EN.md | 2 ++ .../0097.Interleaving String/README.md | 2 ++ .../0097.Interleaving String/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0099.Recover Binary Search Tree/README.md | 2 ++ .../README_EN.md | 2 ++ solution/0100-0199/0100.Same Tree/README.md | 2 ++ .../0100-0199/0100.Same Tree/README_EN.md | 2 ++ .../0100-0199/0101.Symmetric Tree/README.md | 2 ++ .../0101.Symmetric Tree/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0110.Balanced Binary Tree/README.md | 2 ++ .../0110.Balanced Binary Tree/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0100-0199/0112.Path Sum/README.md | 2 ++ solution/0100-0199/0112.Path Sum/README_EN.md | 2 ++ solution/0100-0199/0113.Path Sum II/README.md | 2 ++ .../0100-0199/0113.Path Sum II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0115.Distinct Subsequences/README.md | 2 ++ .../0115.Distinct Subsequences/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0118.Pascal's Triangle/README.md | 2 ++ .../0118.Pascal's Triangle/README_EN.md | 2 ++ .../0119.Pascal's Triangle II/README.md | 2 ++ .../0119.Pascal's Triangle II/README_EN.md | 2 ++ solution/0100-0199/0120.Triangle/README.md | 2 ++ solution/0100-0199/0120.Triangle/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0100-0199/0125.Valid Palindrome/README.md | 2 ++ .../0125.Valid Palindrome/README_EN.md | 2 ++ .../0100-0199/0126.Word Ladder II/README.md | 2 ++ .../0126.Word Ladder II/README_EN.md | 2 ++ solution/0100-0199/0127.Word Ladder/README.md | 2 ++ .../0100-0199/0127.Word Ladder/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0129.Sum Root to Leaf Numbers/README.md | 2 ++ .../README_EN.md | 2 ++ .../0130.Surrounded Regions/README.md | 2 ++ .../0130.Surrounded Regions/README_EN.md | 2 ++ .../0131.Palindrome Partitioning/README.md | 2 ++ .../0131.Palindrome Partitioning/README_EN.md | 2 ++ .../0132.Palindrome Partitioning II/README.md | 2 ++ .../README_EN.md | 2 ++ solution/0100-0199/0133.Clone Graph/README.md | 2 ++ .../0100-0199/0133.Clone Graph/README_EN.md | 2 ++ solution/0100-0199/0134.Gas Station/README.md | 2 ++ .../0100-0199/0134.Gas Station/README_EN.md | 2 ++ solution/0100-0199/0135.Candy/README.md | 2 ++ solution/0100-0199/0135.Candy/README_EN.md | 2 ++ .../0100-0199/0136.Single Number/README.md | 2 ++ .../0100-0199/0136.Single Number/README_EN.md | 2 ++ .../0100-0199/0137.Single Number II/README.md | 2 ++ .../0137.Single Number II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0100-0199/0139.Word Break/README.md | 2 ++ .../0100-0199/0139.Word Break/README_EN.md | 2 ++ .../0100-0199/0140.Word Break II/README.md | 2 ++ .../0100-0199/0140.Word Break II/README_EN.md | 2 ++ .../0141.Linked List Cycle/README.md | 2 ++ .../0141.Linked List Cycle/README_EN.md | 2 ++ .../0142.Linked List Cycle II/README.md | 2 ++ .../0142.Linked List Cycle II/README_EN.md | 2 ++ .../0100-0199/0143.Reorder List/README.md | 2 ++ .../0100-0199/0143.Reorder List/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0100-0199/0146.Lru Cache/README.md | 2 ++ .../0100-0199/0146.Lru Cache/README_EN.md | 2 ++ .../0147.Insertion Sort List/README.md | 2 ++ .../0147.Insertion Sort List/README_EN.md | 2 ++ solution/0100-0199/0148.Sort List/README.md | 2 ++ .../0100-0199/0148.Sort List/README_EN.md | 2 ++ .../0149.Max Points on a Line/README.md | 2 ++ .../0149.Max Points on a Line/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0151.Reverse Words in a String/README.md | 2 ++ .../README_EN.md | 2 ++ .../0152.Maximum Product Subarray/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0100-0199/0155.Min Stack/README.md | 2 ++ .../0100-0199/0155.Min Stack/README_EN.md | 2 ++ .../0156.Binary Tree Upside Down/README.md | 2 ++ .../0156.Binary Tree Upside Down/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0161.One Edit Distance/README.md | 2 ++ .../0161.One Edit Distance/README_EN.md | 2 ++ .../0162.Find Peak Element/README.md | 2 ++ .../0162.Find Peak Element/README_EN.md | 2 ++ .../0100-0199/0163.Missing Ranges/README.md | 2 ++ .../0163.Missing Ranges/README_EN.md | 2 ++ solution/0100-0199/0164.Maximum Gap/README.md | 2 ++ .../0100-0199/0164.Maximum Gap/README_EN.md | 2 ++ .../0165.Compare Version Numbers/README.md | 2 ++ .../0165.Compare Version Numbers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0168.Excel Sheet Column Title/README.md | 2 ++ .../README_EN.md | 2 ++ .../0100-0199/0169.Majority Element/README.md | 2 ++ .../0169.Majority Element/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0171.Excel Sheet Column Number/README.md | 2 ++ .../README_EN.md | 2 ++ .../0172.Factorial Trailing Zeroes/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0100-0199/0174.Dungeon Game/README.md | 2 ++ .../0100-0199/0174.Dungeon Game/README_EN.md | 2 ++ .../0175.Combine Two Tables/README.md | 2 ++ .../0175.Combine Two Tables/README_EN.md | 2 ++ .../0176.Second Highest Salary/README.md | 2 ++ .../0176.Second Highest Salary/README_EN.md | 2 ++ .../0177.Nth Highest Salary/README.md | 2 ++ .../0177.Nth Highest Salary/README_EN.md | 2 ++ solution/0100-0199/0178.Rank Scores/README.md | 2 ++ .../0100-0199/0178.Rank Scores/README_EN.md | 2 ++ .../0100-0199/0179.Largest Number/README.md | 2 ++ .../0179.Largest Number/README_EN.md | 2 ++ .../0180.Consecutive Numbers/README.md | 2 ++ .../0180.Consecutive Numbers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0100-0199/0182.Duplicate Emails/README.md | 2 ++ .../0182.Duplicate Emails/README_EN.md | 2 ++ .../0183.Customers Who Never Order/README.md | 2 ++ .../README_EN.md | 2 ++ .../0184.Department Highest Salary/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0187.Repeated DNA Sequences/README.md | 2 ++ .../0187.Repeated DNA Sequences/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0100-0199/0189.Rotate Array/README.md | 2 ++ .../0100-0199/0189.Rotate Array/README_EN.md | 2 ++ .../0100-0199/0190.Reverse Bits/README.md | 2 ++ .../0100-0199/0190.Reverse Bits/README_EN.md | 2 ++ .../0100-0199/0191.Number of 1 Bits/README.md | 2 ++ .../0191.Number of 1 Bits/README_EN.md | 2 ++ .../0100-0199/0192.Word Frequency/README.md | 2 ++ .../0192.Word Frequency/README_EN.md | 2 ++ .../0193.Valid Phone Numbers/README.md | 2 ++ .../0193.Valid Phone Numbers/README_EN.md | 2 ++ .../0100-0199/0194.Transpose File/README.md | 2 ++ .../0194.Transpose File/README_EN.md | 2 ++ solution/0100-0199/0195.Tenth Line/README.md | 2 ++ .../0100-0199/0195.Tenth Line/README_EN.md | 2 ++ .../0196.Delete Duplicate Emails/README.md | 2 ++ .../0196.Delete Duplicate Emails/README_EN.md | 2 ++ .../0197.Rising Temperature/README.md | 2 ++ .../0197.Rising Temperature/README_EN.md | 2 ++ .../0100-0199/0198.House Robber/README.md | 2 ++ .../0100-0199/0198.House Robber/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0100-0199/test.py | 29 +++++++++++++++++++ .../0200.Number of Islands/README.md | 2 ++ .../0200.Number of Islands/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0202.Happy Number/README.md | 2 ++ .../0200-0299/0202.Happy Number/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0204.Count Primes/README.md | 2 ++ .../0200-0299/0204.Count Primes/README_EN.md | 2 ++ .../0205.Isomorphic Strings/README.md | 2 ++ .../0205.Isomorphic Strings/README_EN.md | 2 ++ .../0206.Reverse Linked List/README.md | 2 ++ .../0206.Reverse Linked List/README_EN.md | 2 ++ .../0200-0299/0207.Course Schedule/README.md | 2 ++ .../0207.Course Schedule/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0209.Minimum Size Subarray Sum/README.md | 2 ++ .../README_EN.md | 2 ++ .../0210.Course Schedule II/README.md | 2 ++ .../0210.Course Schedule II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0212.Word Search II/README.md | 2 ++ .../0212.Word Search II/README_EN.md | 2 ++ .../0200-0299/0213.House Robber II/README.md | 2 ++ .../0213.House Robber II/README_EN.md | 2 ++ .../0214.Shortest Palindrome/README.md | 2 ++ .../0214.Shortest Palindrome/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0216.Combination Sum III/README.md | 2 ++ .../0216.Combination Sum III/README_EN.md | 2 ++ .../0217.Contains Duplicate/README.md | 2 ++ .../0217.Contains Duplicate/README_EN.md | 2 ++ .../0218.The Skyline Problem/README.md | 2 ++ .../0218.The Skyline Problem/README_EN.md | 2 ++ .../0219.Contains Duplicate II/README.md | 2 ++ .../0219.Contains Duplicate II/README_EN.md | 2 ++ .../0220.Contains Duplicate III/README.md | 2 ++ .../0220.Contains Duplicate III/README_EN.md | 2 ++ .../0200-0299/0221.Maximal Square/README.md | 2 ++ .../0221.Maximal Square/README_EN.md | 2 ++ .../0222.Count Complete Tree Nodes/README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0223.Rectangle Area/README.md | 2 ++ .../0223.Rectangle Area/README_EN.md | 2 ++ .../0200-0299/0224.Basic Calculator/README.md | 2 ++ .../0224.Basic Calculator/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0226.Invert Binary Tree/README.md | 2 ++ .../0226.Invert Binary Tree/README_EN.md | 2 ++ .../0227.Basic Calculator II/README.md | 2 ++ .../0227.Basic Calculator II/README_EN.md | 2 ++ .../0200-0299/0228.Summary Ranges/README.md | 2 ++ .../0228.Summary Ranges/README_EN.md | 2 ++ .../0229.Majority Element II/README.md | 2 ++ .../0229.Majority Element II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0231.Power of Two/README.md | 2 ++ .../0200-0299/0231.Power of Two/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0233.Number of Digit One/README.md | 2 ++ .../0233.Number of Digit One/README_EN.md | 2 ++ .../0234.Palindrome Linked List/README.md | 2 ++ .../0234.Palindrome Linked List/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0239.Sliding Window Maximum/README.md | 2 ++ .../0239.Sliding Window Maximum/README_EN.md | 2 ++ .../0240.Search a 2D Matrix II/README.md | 2 ++ .../0240.Search a 2D Matrix II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0242.Valid Anagram/README.md | 2 ++ .../0200-0299/0242.Valid Anagram/README_EN.md | 2 ++ .../0243.Shortest Word Distance/README.md | 2 ++ .../0243.Shortest Word Distance/README_EN.md | 2 ++ .../0244.Shortest Word Distance II/README.md | 2 ++ .../README_EN.md | 2 ++ .../0245.Shortest Word Distance III/README.md | 2 ++ .../README_EN.md | 2 ++ .../0246.Strobogrammatic Number/README.md | 2 ++ .../0246.Strobogrammatic Number/README_EN.md | 2 ++ .../0247.Strobogrammatic Number II/README.md | 2 ++ .../README_EN.md | 2 ++ .../0248.Strobogrammatic Number III/README.md | 2 ++ .../README_EN.md | 2 ++ .../0249.Group Shifted Strings/README.md | 2 ++ .../0249.Group Shifted Strings/README_EN.md | 2 ++ .../0250.Count Univalue Subtrees/README.md | 2 ++ .../0250.Count Univalue Subtrees/README_EN.md | 2 ++ .../0251.Flatten 2D Vector/README.md | 2 ++ .../0251.Flatten 2D Vector/README_EN.md | 2 ++ .../0200-0299/0252.Meeting Rooms/README.md | 2 ++ .../0200-0299/0252.Meeting Rooms/README_EN.md | 2 ++ .../0200-0299/0253.Meeting Rooms II/README.md | 2 ++ .../0253.Meeting Rooms II/README_EN.md | 2 ++ .../0254.Factor Combinations/README.md | 2 ++ .../0254.Factor Combinations/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0200-0299/0256.Paint House/README.md | 2 ++ .../0200-0299/0256.Paint House/README_EN.md | 2 ++ .../0257.Binary Tree Paths/README.md | 2 ++ .../0257.Binary Tree Paths/README_EN.md | 2 ++ solution/0200-0299/0258.Add Digits/README.md | 2 ++ .../0200-0299/0258.Add Digits/README_EN.md | 2 ++ .../0200-0299/0259.3Sum Smaller/README.md | 2 ++ .../0200-0299/0259.3Sum Smaller/README_EN.md | 2 ++ .../0260.Single Number III/README.md | 2 ++ .../0260.Single Number III/README_EN.md | 2 ++ .../0200-0299/0261.Graph Valid Tree/README.md | 2 ++ .../0261.Graph Valid Tree/README_EN.md | 2 ++ .../0200-0299/0262.Trips and Users/README.md | 2 ++ .../0262.Trips and Users/README_EN.md | 2 ++ solution/0200-0299/0263.Ugly Number/README.md | 2 ++ .../0200-0299/0263.Ugly Number/README_EN.md | 2 ++ .../0200-0299/0264.Ugly Number II/README.md | 2 ++ .../0264.Ugly Number II/README_EN.md | 2 ++ .../0200-0299/0265.Paint House II/README.md | 2 ++ .../0265.Paint House II/README_EN.md | 2 ++ .../0266.Palindrome Permutation/README.md | 2 ++ .../0266.Palindrome Permutation/README_EN.md | 2 ++ .../0267.Palindrome Permutation II/README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0268.Missing Number/README.md | 2 ++ .../0268.Missing Number/README_EN.md | 2 ++ .../0200-0299/0269.Alien Dictionary/README.md | 2 ++ .../0269.Alien Dictionary/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0271.Encode and Decode Strings/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0273.Integer to English Words/README.md | 2 ++ .../README_EN.md | 2 ++ solution/0200-0299/0274.H-Index/README.md | 2 ++ solution/0200-0299/0274.H-Index/README_EN.md | 2 ++ solution/0200-0299/0275.H-Index II/README.md | 2 ++ .../0200-0299/0275.H-Index II/README_EN.md | 2 ++ solution/0200-0299/0276.Paint Fence/README.md | 2 ++ .../0200-0299/0276.Paint Fence/README_EN.md | 2 ++ .../0277.Find the Celebrity/README.md | 2 ++ .../0277.Find the Celebrity/README_EN.md | 2 ++ .../0278.First Bad Version/README.md | 2 ++ .../0278.First Bad Version/README_EN.md | 2 ++ .../0200-0299/0279.Perfect Squares/README.md | 2 ++ .../0279.Perfect Squares/README_EN.md | 2 ++ solution/0200-0299/0280.Wiggle Sort/README.md | 2 ++ .../0200-0299/0280.Wiggle Sort/README_EN.md | 2 ++ .../0200-0299/0281.Zigzag Iterator/README.md | 2 ++ .../0281.Zigzag Iterator/README_EN.md | 2 ++ .../0282.Expression Add Operators/README.md | 2 ++ .../README_EN.md | 2 ++ solution/0200-0299/0283.Move Zeroes/README.md | 2 ++ .../0200-0299/0283.Move Zeroes/README_EN.md | 2 ++ .../0200-0299/0284.Peeking Iterator/README.md | 2 ++ .../0284.Peeking Iterator/README_EN.md | 2 ++ .../0285.Inorder Successor in BST/README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0286.Walls and Gates/README.md | 2 ++ .../0286.Walls and Gates/README_EN.md | 2 ++ .../0287.Find the Duplicate Number/README.md | 2 ++ .../README_EN.md | 2 ++ .../0288.Unique Word Abbreviation/README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0289.Game of Life/README.md | 2 ++ .../0200-0299/0289.Game of Life/README_EN.md | 2 ++ .../0200-0299/0290.Word Pattern/README.md | 2 ++ .../0200-0299/0290.Word Pattern/README_EN.md | 2 ++ .../0200-0299/0291.Word Pattern II/README.md | 2 ++ .../0291.Word Pattern II/README_EN.md | 2 ++ solution/0200-0299/0292.Nim Game/README.md | 2 ++ solution/0200-0299/0292.Nim Game/README_EN.md | 2 ++ solution/0200-0299/0293.Flip Game/README.md | 2 ++ .../0200-0299/0293.Flip Game/README_EN.md | 2 ++ .../0200-0299/0294.Flip Game II/README.md | 2 ++ .../0200-0299/0294.Flip Game II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0296.Best Meeting Point/README.md | 2 ++ .../0296.Best Meeting Point/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0200-0299/0299.Bulls and Cows/README.md | 2 ++ .../0299.Bulls and Cows/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0301.Remove Invalid Parentheses/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0305.Number of Islands II/README.md | 2 ++ .../0305.Number of Islands II/README_EN.md | 2 ++ .../0300-0399/0306.Additive Number/README.md | 2 ++ .../0306.Additive Number/README_EN.md | 2 ++ .../0307.Range Sum Query - Mutable/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0310.Minimum Height Trees/README.md | 2 ++ .../0310.Minimum Height Trees/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0300-0399/0312.Burst Balloons/README.md | 2 ++ .../0312.Burst Balloons/README_EN.md | 2 ++ .../0313.Super Ugly Number/README.md | 2 ++ .../0313.Super Ugly Number/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0316.Remove Duplicate Letters/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0300-0399/0319.Bulb Switcher/README.md | 2 ++ .../0300-0399/0319.Bulb Switcher/README_EN.md | 2 ++ .../0320.Generalized Abbreviation/README.md | 2 ++ .../README_EN.md | 2 ++ .../0321.Create Maximum Number/README.md | 2 ++ .../0321.Create Maximum Number/README_EN.md | 2 ++ solution/0300-0399/0322.Coin Change/README.md | 2 ++ .../0300-0399/0322.Coin Change/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0300-0399/0324.Wiggle Sort II/README.md | 2 ++ .../0324.Wiggle Sort II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0300-0399/0326.Power of Three/README.md | 2 ++ .../0326.Power of Three/README_EN.md | 2 ++ .../0327.Count of Range Sum/README.md | 2 ++ .../0327.Count of Range Sum/README_EN.md | 2 ++ .../0328.Odd Even Linked List/README.md | 2 ++ .../0328.Odd Even Linked List/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0300-0399/0330.Patching Array/README.md | 2 ++ .../0330.Patching Array/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0332.Reconstruct Itinerary/README.md | 2 ++ .../0332.Reconstruct Itinerary/README_EN.md | 2 ++ .../0333.Largest BST Subtree/README.md | 2 ++ .../0333.Largest BST Subtree/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0300-0399/0335.Self Crossing/README.md | 2 ++ .../0300-0399/0335.Self Crossing/README_EN.md | 2 ++ .../0300-0399/0336.Palindrome Pairs/README.md | 2 ++ .../0336.Palindrome Pairs/README_EN.md | 2 ++ .../0300-0399/0337.House Robber III/README.md | 2 ++ .../0337.House Robber III/README_EN.md | 2 ++ .../0300-0399/0338.Counting Bits/README.md | 2 ++ .../0300-0399/0338.Counting Bits/README_EN.md | 2 ++ .../0339.Nested List Weight Sum/README.md | 2 ++ .../0339.Nested List Weight Sum/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0300-0399/0342.Power of Four/README.md | 2 ++ .../0300-0399/0342.Power of Four/README_EN.md | 2 ++ .../0300-0399/0343.Integer Break/README.md | 2 ++ .../0300-0399/0343.Integer Break/README_EN.md | 2 ++ .../0300-0399/0344.Reverse String/README.md | 2 ++ .../0344.Reverse String/README_EN.md | 2 ++ .../0345.Reverse Vowels of a String/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0347.Top K Frequent Elements/README.md | 2 ++ .../0347.Top K Frequent Elements/README_EN.md | 2 ++ .../0348.Design Tic-Tac-Toe/README.md | 2 ++ .../0348.Design Tic-Tac-Toe/README_EN.md | 2 ++ .../0349.Intersection of Two Arrays/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0351.Android Unlock Patterns/README.md | 2 ++ .../0351.Android Unlock Patterns/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0353.Design Snake Game/README.md | 2 ++ .../0353.Design Snake Game/README_EN.md | 2 ++ .../0354.Russian Doll Envelopes/README.md | 2 ++ .../0354.Russian Doll Envelopes/README_EN.md | 2 ++ .../0300-0399/0355.Design Twitter/README.md | 2 ++ .../0355.Design Twitter/README_EN.md | 2 ++ .../0300-0399/0356.Line Reflection/README.md | 2 ++ .../0356.Line Reflection/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0359.Logger Rate Limiter/README.md | 2 ++ .../0359.Logger Rate Limiter/README_EN.md | 2 ++ .../0360.Sort Transformed Array/README.md | 2 ++ .../0360.Sort Transformed Array/README_EN.md | 2 ++ solution/0300-0399/0361.Bomb Enemy/README.md | 2 ++ .../0300-0399/0361.Bomb Enemy/README_EN.md | 2 ++ .../0362.Design Hit Counter/README.md | 2 ++ .../0362.Design Hit Counter/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0364.Nested List Weight Sum II/README.md | 2 ++ .../README_EN.md | 2 ++ .../0365.Water and Jug Problem/README.md | 2 ++ .../0365.Water and Jug Problem/README_EN.md | 2 ++ .../0366.Find Leaves of Binary Tree/README.md | 2 ++ .../README_EN.md | 2 ++ .../0367.Valid Perfect Square/README.md | 2 ++ .../0367.Valid Perfect Square/README_EN.md | 2 ++ .../0368.Largest Divisible Subset/README.md | 2 ++ .../README_EN.md | 2 ++ .../0369.Plus One Linked List/README.md | 2 ++ .../0369.Plus One Linked List/README_EN.md | 2 ++ .../0300-0399/0370.Range Addition/README.md | 2 ++ .../0370.Range Addition/README_EN.md | 2 ++ .../0371.Sum of Two Integers/README.md | 2 ++ .../0371.Sum of Two Integers/README_EN.md | 2 ++ solution/0300-0399/0372.Super Pow/README.md | 2 ++ .../0300-0399/0372.Super Pow/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0376.Wiggle Subsequence/README.md | 2 ++ .../0376.Wiggle Subsequence/README_EN.md | 2 ++ .../0377.Combination Sum IV/README.md | 2 ++ .../0377.Combination Sum IV/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0379.Design Phone Directory/README.md | 2 ++ .../0379.Design Phone Directory/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0382.Linked List Random Node/README.md | 2 ++ .../0382.Linked List Random Node/README_EN.md | 2 ++ solution/0300-0399/0383.Ransom Note/README.md | 2 ++ .../0300-0399/0383.Ransom Note/README_EN.md | 2 ++ .../0300-0399/0384.Shuffle an Array/README.md | 2 ++ .../0384.Shuffle an Array/README_EN.md | 2 ++ solution/0300-0399/0385.Mini Parser/README.md | 2 ++ .../0300-0399/0385.Mini Parser/README_EN.md | 2 ++ .../0386.Lexicographical Numbers/README.md | 2 ++ .../0386.Lexicographical Numbers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0388.Longest Absolute File Path/README.md | 2 ++ .../README_EN.md | 2 ++ .../0389.Find the Difference/README.md | 2 ++ .../0389.Find the Difference/README_EN.md | 2 ++ .../0300-0399/0390.Elimination Game/README.md | 2 ++ .../0390.Elimination Game/README_EN.md | 2 ++ .../0391.Perfect Rectangle/README.md | 2 ++ .../0391.Perfect Rectangle/README_EN.md | 2 ++ .../0300-0399/0392.Is Subsequence/README.md | 2 ++ .../0392.Is Subsequence/README_EN.md | 2 ++ .../0300-0399/0393.UTF-8 Validation/README.md | 2 ++ .../0393.UTF-8 Validation/README_EN.md | 2 ++ .../0300-0399/0394.Decode String/README.md | 2 ++ .../0300-0399/0394.Decode String/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0300-0399/0396.Rotate Function/README.md | 2 ++ .../0396.Rotate Function/README_EN.md | 2 ++ .../0397.Integer Replacement/README.md | 2 ++ .../0397.Integer Replacement/README_EN.md | 2 ++ .../0398.Random Pick Index/README.md | 2 ++ .../0398.Random Pick Index/README_EN.md | 2 ++ .../0399.Evaluate Division/README.md | 2 ++ .../0399.Evaluate Division/README_EN.md | 2 ++ solution/0400-0499/0400.Nth Digit/README.md | 2 ++ .../0400-0499/0400.Nth Digit/README_EN.md | 2 ++ .../0400-0499/0401.Binary Watch/README.md | 2 ++ .../0400-0499/0401.Binary Watch/README_EN.md | 2 ++ .../0400-0499/0402.Remove K Digits/README.md | 2 ++ .../0402.Remove K Digits/README_EN.md | 2 ++ solution/0400-0499/0403.Frog Jump/README.md | 2 ++ .../0400-0499/0403.Frog Jump/README_EN.md | 2 ++ .../0404.Sum of Left Leaves/README.md | 2 ++ .../0404.Sum of Left Leaves/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0407.Trapping Rain Water II/README.md | 2 ++ .../0407.Trapping Rain Water II/README_EN.md | 2 ++ .../0408.Valid Word Abbreviation/README.md | 2 ++ .../0408.Valid Word Abbreviation/README_EN.md | 2 ++ .../0409.Longest Palindrome/README.md | 2 ++ .../0409.Longest Palindrome/README_EN.md | 2 ++ .../0410.Split Array Largest Sum/README.md | 2 ++ .../0410.Split Array Largest Sum/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0400-0499/0412.Fizz Buzz/README.md | 2 ++ .../0400-0499/0412.Fizz Buzz/README_EN.md | 2 ++ .../0413.Arithmetic Slices/README.md | 2 ++ .../0413.Arithmetic Slices/README_EN.md | 2 ++ .../0414.Third Maximum Number/README.md | 2 ++ .../0414.Third Maximum Number/README_EN.md | 2 ++ solution/0400-0499/0415.Add Strings/README.md | 2 ++ .../0400-0499/0415.Add Strings/README_EN.md | 2 ++ .../0416.Partition Equal Subset Sum/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0418.Sentence Screen Fitting/README.md | 2 ++ .../0418.Sentence Screen Fitting/README_EN.md | 2 ++ .../0419.Battleships in a Board/README.md | 2 ++ .../0419.Battleships in a Board/README_EN.md | 2 ++ .../0420.Strong Password Checker/README.md | 2 ++ .../0420.Strong Password Checker/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0422.Valid Word Square/README.md | 2 ++ .../0422.Valid Word Square/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0400-0499/0425.Word Squares/README.md | 2 ++ .../0400-0499/0425.Word Squares/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0427.Construct Quad Tree/README.md | 2 ++ .../0427.Construct Quad Tree/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0432.All O`one Data Structure/README.md | 2 ++ .../README_EN.md | 2 ++ .../0433.Minimum Genetic Mutation/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0435.Non-overlapping Intervals/README.md | 2 ++ .../README_EN.md | 2 ++ .../0436.Find Right Interval/README.md | 2 ++ .../0436.Find Right Interval/README_EN.md | 2 ++ .../0400-0499/0437.Path Sum III/README.md | 2 ++ .../0400-0499/0437.Path Sum III/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0439.Ternary Expression Parser/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0400-0499/0441.Arranging Coins/README.md | 2 ++ .../0441.Arranging Coins/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0443.String Compression/README.md | 2 ++ .../0443.String Compression/README_EN.md | 2 ++ .../0444.Sequence Reconstruction/README.md | 2 ++ .../0444.Sequence Reconstruction/README_EN.md | 2 ++ .../0445.Add Two Numbers II/README.md | 2 ++ .../0445.Add Two Numbers II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0447.Number of Boomerangs/README.md | 2 ++ .../0447.Number of Boomerangs/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0450.Delete Node in a BST/README.md | 2 ++ .../0450.Delete Node in a BST/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0400-0499/0454.4Sum II/README.md | 2 ++ solution/0400-0499/0454.4Sum II/README_EN.md | 2 ++ .../0400-0499/0455.Assign Cookies/README.md | 2 ++ .../0455.Assign Cookies/README_EN.md | 2 ++ solution/0400-0499/0456.132 Pattern/README.md | 2 ++ .../0400-0499/0456.132 Pattern/README_EN.md | 2 ++ .../0457.Circular Array Loop/README.md | 2 ++ .../0457.Circular Array Loop/README_EN.md | 2 ++ solution/0400-0499/0458.Poor Pigs/README.md | 2 ++ .../0400-0499/0458.Poor Pigs/README_EN.md | 2 ++ .../0459.Repeated Substring Pattern/README.md | 2 ++ .../README_EN.md | 2 ++ solution/0400-0499/0460.LFU Cache/README.md | 2 ++ .../0400-0499/0460.LFU Cache/README_EN.md | 2 ++ .../0400-0499/0461.Hamming Distance/README.md | 2 ++ .../0461.Hamming Distance/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0400-0499/0463.Island Perimeter/README.md | 2 ++ .../0463.Island Perimeter/README_EN.md | 2 ++ solution/0400-0499/0464.Can I Win/README.md | 2 ++ .../0400-0499/0464.Can I Win/README_EN.md | 2 ++ .../0465.Optimal Account Balancing/README.md | 2 ++ .../README_EN.md | 2 ++ .../0466.Count The Repetitions/README.md | 2 ++ .../0466.Count The Repetitions/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0468.Validate IP Address/README.md | 2 ++ .../0468.Validate IP Address/README_EN.md | 2 ++ .../0400-0499/0469.Convex Polygon/README.md | 2 ++ .../0469.Convex Polygon/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0472.Concatenated Words/README.md | 2 ++ .../0472.Concatenated Words/README_EN.md | 2 ++ .../0473.Matchsticks to Square/README.md | 2 ++ .../0473.Matchsticks to Square/README_EN.md | 2 ++ .../0400-0499/0474.Ones and Zeroes/README.md | 2 ++ .../0474.Ones and Zeroes/README_EN.md | 2 ++ solution/0400-0499/0475.Heaters/README.md | 2 ++ solution/0400-0499/0475.Heaters/README_EN.md | 2 ++ .../0476.Number Complement/README.md | 2 ++ .../0476.Number Complement/README_EN.md | 2 ++ .../0477.Total Hamming Distance/README.md | 2 ++ .../0477.Total Hamming Distance/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0479.Largest Palindrome Product/README.md | 2 ++ .../README_EN.md | 2 ++ .../0480.Sliding Window Median/README.md | 2 ++ .../0480.Sliding Window Median/README_EN.md | 2 ++ .../0400-0499/0481.Magical String/README.md | 2 ++ .../0481.Magical String/README_EN.md | 2 ++ .../0482.License Key Formatting/README.md | 2 ++ .../0482.License Key Formatting/README_EN.md | 2 ++ .../0483.Smallest Good Base/README.md | 2 ++ .../0483.Smallest Good Base/README_EN.md | 2 ++ .../0400-0499/0484.Find Permutation/README.md | 2 ++ .../0484.Find Permutation/README_EN.md | 2 ++ .../0485.Max Consecutive Ones/README.md | 2 ++ .../0485.Max Consecutive Ones/README_EN.md | 2 ++ .../0486.Predict the Winner/README.md | 2 ++ .../0486.Predict the Winner/README_EN.md | 2 ++ .../0487.Max Consecutive Ones II/README.md | 2 ++ .../0487.Max Consecutive Ones II/README_EN.md | 2 ++ solution/0400-0499/0488.Zuma Game/README.md | 2 ++ .../0400-0499/0488.Zuma Game/README_EN.md | 2 ++ .../0489.Robot Room Cleaner/README.md | 2 ++ .../0489.Robot Room Cleaner/README_EN.md | 2 ++ solution/0400-0499/0490.The Maze/README.md | 2 ++ solution/0400-0499/0490.The Maze/README_EN.md | 2 ++ .../0491.Increasing Subsequences/README.md | 2 ++ .../0491.Increasing Subsequences/README_EN.md | 2 ++ .../0492.Construct the Rectangle/README.md | 2 ++ .../0492.Construct the Rectangle/README_EN.md | 2 ++ .../0400-0499/0493.Reverse Pairs/README.md | 2 ++ .../0400-0499/0493.Reverse Pairs/README_EN.md | 2 ++ solution/0400-0499/0494.Target Sum/README.md | 2 ++ .../0400-0499/0494.Target Sum/README_EN.md | 2 ++ .../0400-0499/0495.Teemo Attacking/README.md | 2 ++ .../0495.Teemo Attacking/README_EN.md | 2 ++ .../0496.Next Greater Element I/README.md | 2 ++ .../0496.Next Greater Element I/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0498.Diagonal Traverse/README.md | 2 ++ .../0498.Diagonal Traverse/README_EN.md | 2 ++ .../0400-0499/0499.The Maze III/README.md | 2 ++ .../0400-0499/0499.The Maze III/README_EN.md | 2 ++ .../0500-0599/0500.Keyboard Row/README.md | 2 ++ .../0500-0599/0500.Keyboard Row/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0500-0599/0502.IPO/README.md | 2 ++ solution/0500-0599/0502.IPO/README_EN.md | 2 ++ .../0503.Next Greater Element II/README.md | 2 ++ .../0503.Next Greater Element II/README_EN.md | 2 ++ solution/0500-0599/0504.Base 7/README.md | 2 ++ solution/0500-0599/0504.Base 7/README_EN.md | 2 ++ solution/0500-0599/0505.The Maze II/README.md | 2 ++ .../0500-0599/0505.The Maze II/README_EN.md | 2 ++ .../0500-0599/0506.Relative Ranks/README.md | 2 ++ .../0506.Relative Ranks/README_EN.md | 2 ++ .../0500-0599/0507.Perfect Number/README.md | 2 ++ .../0507.Perfect Number/README_EN.md | 2 ++ .../0508.Most Frequent Subtree Sum/README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0509.Fibonacci Number/README.md | 2 ++ .../0509.Fibonacci Number/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0511.Game Play Analysis I/README.md | 2 ++ .../0511.Game Play Analysis I/README_EN.md | 2 ++ .../0512.Game Play Analysis II/README.md | 2 ++ .../0512.Game Play Analysis II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0514.Freedom Trail/README.md | 2 ++ .../0500-0599/0514.Freedom Trail/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0517.Super Washing Machines/README.md | 2 ++ .../0517.Super Washing Machines/README_EN.md | 2 ++ .../0500-0599/0518.Coin Change 2/README.md | 2 ++ .../0500-0599/0518.Coin Change 2/README_EN.md | 2 ++ .../0519.Random Flip Matrix/README.md | 2 ++ .../0519.Random Flip Matrix/README_EN.md | 2 ++ .../0500-0599/0520.Detect Capital/README.md | 2 ++ .../0520.Detect Capital/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0523.Continuous Subarray Sum/README.md | 2 ++ .../0523.Continuous Subarray Sum/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0525.Contiguous Array/README.md | 2 ++ .../0525.Contiguous Array/README_EN.md | 2 ++ .../0526.Beautiful Arrangement/README.md | 2 ++ .../0526.Beautiful Arrangement/README_EN.md | 2 ++ .../0527.Word Abbreviation/README.md | 2 ++ .../0527.Word Abbreviation/README_EN.md | 2 ++ .../0528.Random Pick with Weight/README.md | 2 ++ .../0528.Random Pick with Weight/README_EN.md | 2 ++ solution/0500-0599/0529.Minesweeper/README.md | 2 ++ .../0500-0599/0529.Minesweeper/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0531.Lonely Pixel I/README.md | 2 ++ .../0531.Lonely Pixel I/README_EN.md | 2 ++ .../0532.K-diff Pairs in an Array/README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0533.Lonely Pixel II/README.md | 2 ++ .../0533.Lonely Pixel II/README_EN.md | 2 ++ .../0534.Game Play Analysis III/README.md | 2 ++ .../0534.Game Play Analysis III/README_EN.md | 2 ++ .../0535.Encode and Decode TinyURL/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0539.Minimum Time Difference/README.md | 2 ++ .../0539.Minimum Time Difference/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0541.Reverse String II/README.md | 2 ++ .../0541.Reverse String II/README_EN.md | 2 ++ solution/0500-0599/0542.01 Matrix/README.md | 2 ++ .../0500-0599/0542.01 Matrix/README_EN.md | 2 ++ .../0543.Diameter of Binary Tree/README.md | 2 ++ .../0543.Diameter of Binary Tree/README_EN.md | 2 ++ .../0544.Output Contest Matches/README.md | 2 ++ .../0544.Output Contest Matches/README_EN.md | 2 ++ .../0545.Boundary of Binary Tree/README.md | 2 ++ .../0545.Boundary of Binary Tree/README_EN.md | 2 ++ .../0500-0599/0546.Remove Boxes/README.md | 2 ++ .../0500-0599/0546.Remove Boxes/README_EN.md | 2 ++ .../0500-0599/0547.Friend Circles/README.md | 2 ++ .../0547.Friend Circles/README_EN.md | 2 ++ .../0548.Split Array with Equal Sum/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0550.Game Play Analysis IV/README.md | 2 ++ .../0550.Game Play Analysis IV/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0553.Optimal Division/README.md | 2 ++ .../0553.Optimal Division/README_EN.md | 2 ++ solution/0500-0599/0554.Brick Wall/README.md | 2 ++ .../0500-0599/0554.Brick Wall/README_EN.md | 2 ++ .../0555.Split Concatenated Strings/README.md | 2 ++ .../README_EN.md | 2 ++ .../0556.Next Greater Element III/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0560.Subarray Sum Equals K/README.md | 2 ++ .../0560.Subarray Sum Equals K/README_EN.md | 2 ++ .../0561.Array Partition I/README.md | 2 ++ .../0561.Array Partition I/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0563.Binary Tree Tilt/README.md | 2 ++ .../0563.Binary Tree Tilt/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0565.Array Nesting/README.md | 2 ++ .../0500-0599/0565.Array Nesting/README_EN.md | 2 ++ .../0566.Reshape the Matrix/README.md | 2 ++ .../0566.Reshape the Matrix/README_EN.md | 2 ++ .../0567.Permutation in String/README.md | 2 ++ .../0567.Permutation in String/README_EN.md | 2 ++ .../0568.Maximum Vacation Days/README.md | 2 ++ .../0568.Maximum Vacation Days/README_EN.md | 2 ++ .../0569.Median Employee Salary/README.md | 2 ++ .../0569.Median Employee Salary/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0572.Subtree of Another Tree/README.md | 2 ++ .../0572.Subtree of Another Tree/README_EN.md | 2 ++ .../0573.Squirrel Simulation/README.md | 2 ++ .../0573.Squirrel Simulation/README_EN.md | 2 ++ .../0574.Winning Candidate/README.md | 2 ++ .../0574.Winning Candidate/README_EN.md | 2 ++ .../0575.Distribute Candies/README.md | 2 ++ .../0575.Distribute Candies/README_EN.md | 2 ++ .../0576.Out of Boundary Paths/README.md | 2 ++ .../0576.Out of Boundary Paths/README_EN.md | 2 ++ .../0500-0599/0577.Employee Bonus/README.md | 2 ++ .../0577.Employee Bonus/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0582.Kill Process/README.md | 2 ++ .../0500-0599/0582.Kill Process/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0584.Find Customer Referee/README.md | 2 ++ .../0584.Find Customer Referee/README_EN.md | 2 ++ .../0585.Investments in 2016/README.md | 2 ++ .../0585.Investments in 2016/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0587.Erect the Fence/README.md | 2 ++ .../0587.Erect the Fence/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0591.Tag Validator/README.md | 2 ++ .../0500-0599/0591.Tag Validator/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0593.Valid Square/README.md | 2 ++ .../0500-0599/0593.Valid Square/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0500-0599/0595.Big Countries/README.md | 2 ++ .../0500-0599/0595.Big Countries/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0598.Range Addition II/README.md | 2 ++ .../0598.Range Addition II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0601.Human Traffic of Stadium/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0605.Can Place Flowers/README.md | 2 ++ .../0605.Can Place Flowers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0600-0699/0607.Sales Person/README.md | 2 ++ .../0600-0699/0607.Sales Person/README_EN.md | 2 ++ solution/0600-0699/0608.Tree Node/README.md | 2 ++ .../0600-0699/0608.Tree Node/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0610.Triangle Judgement/README.md | 2 ++ .../0610.Triangle Judgement/README_EN.md | 2 ++ .../0611.Valid Triangle Number/README.md | 2 ++ .../0611.Valid Triangle Number/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0614.Second Degree Follower/README.md | 2 ++ .../0614.Second Degree Follower/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0616.Add Bold Tag in String/README.md | 2 ++ .../0616.Add Bold Tag in String/README_EN.md | 2 ++ .../0617.Merge Two Binary Trees/README.md | 2 ++ .../0617.Merge Two Binary Trees/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0619.Biggest Single Number/README.md | 2 ++ .../0619.Biggest Single Number/README_EN.md | 2 ++ .../0620.Not Boring Movies/README.md | 2 ++ .../0620.Not Boring Movies/README_EN.md | 2 ++ .../0600-0699/0621.Task Scheduler/README.md | 2 ++ .../0621.Task Scheduler/README_EN.md | 2 ++ .../0622.Design Circular Queue/README.md | 2 ++ .../0622.Design Circular Queue/README_EN.md | 2 ++ .../0623.Add One Row to Tree/README.md | 2 ++ .../0623.Add One Row to Tree/README_EN.md | 2 ++ .../0624.Maximum Distance in Arrays/README.md | 2 ++ .../README_EN.md | 2 ++ .../0625.Minimum Factorization/README.md | 2 ++ .../0625.Minimum Factorization/README_EN.md | 2 ++ .../0600-0699/0626.Exchange Seats/README.md | 2 ++ .../0626.Exchange Seats/README_EN.md | 2 ++ solution/0600-0699/0627.Swap Salary/README.md | 2 ++ .../0600-0699/0627.Swap Salary/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0629.K Inverse Pairs Array/README.md | 2 ++ .../0629.K Inverse Pairs Array/README_EN.md | 2 ++ .../0630.Course Schedule III/README.md | 2 ++ .../0630.Course Schedule III/README_EN.md | 2 ++ .../0631.Design Excel Sum Formula/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0633.Sum of Square Numbers/README.md | 2 ++ .../0633.Sum of Square Numbers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0635.Design Log Storage System/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0600-0699/0638.Shopping Offers/README.md | 2 ++ .../0638.Shopping Offers/README_EN.md | 2 ++ .../0600-0699/0639.Decode Ways II/README.md | 2 ++ .../0639.Decode Ways II/README_EN.md | 2 ++ .../0640.Solve the Equation/README.md | 2 ++ .../0640.Solve the Equation/README_EN.md | 2 ++ .../0641.Design Circular Deque/README.md | 2 ++ .../0641.Design Circular Deque/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0643.Maximum Average Subarray I/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0600-0699/0645.Set Mismatch/README.md | 2 ++ .../0600-0699/0645.Set Mismatch/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0647.Palindromic Substrings/README.md | 2 ++ .../0647.Palindromic Substrings/README_EN.md | 2 ++ .../0600-0699/0648.Replace Words/README.md | 2 ++ .../0600-0699/0648.Replace Words/README_EN.md | 2 ++ .../0600-0699/0649.Dota2 Senate/README.md | 2 ++ .../0600-0699/0649.Dota2 Senate/README_EN.md | 2 ++ .../0600-0699/0650.2 Keys Keyboard/README.md | 2 ++ .../0650.2 Keys Keyboard/README_EN.md | 2 ++ .../0600-0699/0651.4 Keys Keyboard/README.md | 2 ++ .../0651.4 Keys Keyboard/README_EN.md | 2 ++ .../0652.Find Duplicate Subtrees/README.md | 2 ++ .../0652.Find Duplicate Subtrees/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0654.Maximum Binary Tree/README.md | 2 ++ .../0654.Maximum Binary Tree/README_EN.md | 2 ++ .../0655.Print Binary Tree/README.md | 2 ++ .../0655.Print Binary Tree/README_EN.md | 2 ++ solution/0600-0699/0656.Coin Path/README.md | 2 ++ .../0600-0699/0656.Coin Path/README_EN.md | 2 ++ .../0657.Robot Return to Origin/README.md | 2 ++ .../0657.Robot Return to Origin/README_EN.md | 2 ++ .../0658.Find K Closest Elements/README.md | 2 ++ .../0658.Find K Closest Elements/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0600-0699/0660.Remove 9/README.md | 2 ++ solution/0600-0699/0660.Remove 9/README_EN.md | 2 ++ .../0600-0699/0661.Image Smoother/README.md | 2 ++ .../0661.Image Smoother/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0663.Equal Tree Partition/README.md | 2 ++ .../0663.Equal Tree Partition/README_EN.md | 2 ++ .../0600-0699/0664.Strange Printer/README.md | 2 ++ .../0664.Strange Printer/README_EN.md | 2 ++ .../0665.Non-decreasing Array/README.md | 2 ++ .../0665.Non-decreasing Array/README_EN.md | 2 ++ solution/0600-0699/0666.Path Sum IV/README.md | 2 ++ .../0600-0699/0666.Path Sum IV/README_EN.md | 2 ++ .../0667.Beautiful Arrangement II/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0669.Trim a Binary Search Tree/README.md | 2 ++ .../README_EN.md | 2 ++ .../0600-0699/0670.Maximum Swap/README.md | 2 ++ .../0600-0699/0670.Maximum Swap/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0600-0699/0672.Bulb Switcher II/README.md | 2 ++ .../0672.Bulb Switcher II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0676.Implement Magic Dictionary/README.md | 2 ++ .../README_EN.md | 2 ++ .../0600-0699/0677.Map Sum Pairs/README.md | 2 ++ .../0600-0699/0677.Map Sum Pairs/README_EN.md | 2 ++ .../0678.Valid Parenthesis String/README.md | 2 ++ .../README_EN.md | 2 ++ solution/0600-0699/0679.24 Game/README.md | 2 ++ solution/0600-0699/0679.24 Game/README_EN.md | 2 ++ .../0680.Valid Palindrome II/README.md | 2 ++ .../0680.Valid Palindrome II/README_EN.md | 2 ++ .../0681.Next Closest Time/README.md | 2 ++ .../0681.Next Closest Time/README_EN.md | 2 ++ .../0600-0699/0682.Baseball Game/README.md | 2 ++ .../0600-0699/0682.Baseball Game/README_EN.md | 2 ++ .../0600-0699/0683.K Empty Slots/README.md | 2 ++ .../0600-0699/0683.K Empty Slots/README_EN.md | 2 ++ .../0684.Redundant Connection/README.md | 2 ++ .../0684.Redundant Connection/README_EN.md | 2 ++ .../0685.Redundant Connection II/README.md | 2 ++ .../0685.Redundant Connection II/README_EN.md | 2 ++ .../0686.Repeated String Match/README.md | 2 ++ .../0686.Repeated String Match/README_EN.md | 2 ++ .../0687.Longest Univalue Path/README.md | 2 ++ .../0687.Longest Univalue Path/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0690.Employee Importance/README.md | 2 ++ .../0690.Employee Importance/README_EN.md | 2 ++ .../0691.Stickers to Spell Word/README.md | 2 ++ .../0691.Stickers to Spell Word/README_EN.md | 2 ++ .../0692.Top K Frequent Words/README.md | 2 ++ .../0692.Top K Frequent Words/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0694.Number of Distinct Islands/README.md | 2 ++ .../README_EN.md | 2 ++ .../0695.Max Area of Island/README.md | 2 ++ .../0695.Max Area of Island/README_EN.md | 2 ++ .../0696.Count Binary Substrings/README.md | 2 ++ .../0696.Count Binary Substrings/README_EN.md | 2 ++ .../0697.Degree of an Array/README.md | 2 ++ .../0697.Degree of an Array/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0600-0699/0699.Falling Squares/README.md | 2 ++ .../0699.Falling Squares/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0704.Binary Search/README.md | 2 ++ .../0700-0799/0704.Binary Search/README_EN.md | 2 ++ .../0700-0799/0705.Design HashSet/README.md | 2 ++ .../0705.Design HashSet/README_EN.md | 2 ++ .../0700-0799/0706.Design HashMap/README.md | 2 ++ .../0706.Design HashMap/README_EN.md | 2 ++ .../0707.Design Linked List/README.md | 2 ++ .../0707.Design Linked List/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0709.To Lower Case/README.md | 2 ++ .../0700-0799/0709.To Lower Case/README_EN.md | 2 ++ .../0710.Random Pick with Blacklist/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0715.Range Module/README.md | 2 ++ .../0700-0799/0715.Range Module/README_EN.md | 2 ++ solution/0700-0799/0716.Max Stack/README.md | 2 ++ .../0700-0799/0716.Max Stack/README_EN.md | 2 ++ .../0717.1-bit and 2-bit Characters/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0720.Longest Word in Dictionary/README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0721.Accounts Merge/README.md | 2 ++ .../0721.Accounts Merge/README_EN.md | 2 ++ .../0700-0799/0722.Remove Comments/README.md | 2 ++ .../0722.Remove Comments/README_EN.md | 2 ++ solution/0700-0799/0723.Candy Crush/README.md | 2 ++ .../0700-0799/0723.Candy Crush/README_EN.md | 2 ++ .../0700-0799/0724.Find Pivot Index/README.md | 2 ++ .../0724.Find Pivot Index/README_EN.md | 2 ++ .../0725.Split Linked List in Parts/README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0726.Number of Atoms/README.md | 2 ++ .../0726.Number of Atoms/README_EN.md | 2 ++ .../0727.Minimum Window Subsequence/README.md | 2 ++ .../README_EN.md | 2 ++ .../0728.Self Dividing Numbers/README.md | 2 ++ .../0728.Self Dividing Numbers/README_EN.md | 2 ++ .../0700-0799/0729.My Calendar I/README.md | 2 ++ .../0700-0799/0729.My Calendar I/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0731.My Calendar II/README.md | 2 ++ .../0731.My Calendar II/README_EN.md | 2 ++ .../0700-0799/0732.My Calendar III/README.md | 2 ++ .../0732.My Calendar III/README_EN.md | 2 ++ solution/0700-0799/0733.Flood Fill/README.md | 2 ++ .../0700-0799/0733.Flood Fill/README_EN.md | 2 ++ .../0734.Sentence Similarity/README.md | 2 ++ .../0734.Sentence Similarity/README_EN.md | 2 ++ .../0735.Asteroid Collision/README.md | 2 ++ .../0735.Asteroid Collision/README_EN.md | 2 ++ .../0736.Parse Lisp Expression/README.md | 2 ++ .../0736.Parse Lisp Expression/README_EN.md | 2 ++ .../0737.Sentence Similarity II/README.md | 2 ++ .../0737.Sentence Similarity II/README_EN.md | 2 ++ .../0738.Monotone Increasing Digits/README.md | 2 ++ .../README_EN.md | 2 ++ .../0739.Daily Temperatures/README.md | 2 ++ .../0739.Daily Temperatures/README_EN.md | 2 ++ .../0700-0799/0740.Delete and Earn/README.md | 2 ++ .../0740.Delete and Earn/README_EN.md | 2 ++ .../0700-0799/0741.Cherry Pickup/README.md | 2 ++ .../0700-0799/0741.Cherry Pickup/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0743.Network Delay Time/README.md | 2 ++ .../0743.Network Delay Time/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0745.Prefix and Suffix Search/README.md | 2 ++ .../README_EN.md | 2 ++ .../0746.Min Cost Climbing Stairs/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0748.Shortest Completing Word/README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0749.Contain Virus/README.md | 2 ++ .../0700-0799/0749.Contain Virus/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0700-0799/0751.IP to CIDR/README.md | 2 ++ .../0700-0799/0751.IP to CIDR/README_EN.md | 2 ++ .../0700-0799/0752.Open the Lock/README.md | 2 ++ .../0700-0799/0752.Open the Lock/README_EN.md | 2 ++ .../0753.Cracking the Safe/README.md | 2 ++ .../0753.Cracking the Safe/README_EN.md | 2 ++ .../0700-0799/0754.Reach a Number/README.md | 2 ++ .../0754.Reach a Number/README_EN.md | 2 ++ solution/0700-0799/0755.Pour Water/README.md | 2 ++ .../0700-0799/0755.Pour Water/README_EN.md | 2 ++ .../0756.Pyramid Transition Matrix/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0758.Bold Words in String/README.md | 2 ++ .../0758.Bold Words in String/README_EN.md | 2 ++ .../0759.Employee Free Time/README.md | 2 ++ .../0759.Employee Free Time/README_EN.md | 2 ++ .../0760.Find Anagram Mappings/README.md | 2 ++ .../0760.Find Anagram Mappings/README_EN.md | 2 ++ .../0761.Special Binary String/README.md | 2 ++ .../0761.Special Binary String/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0763.Partition Labels/README.md | 2 ++ .../0763.Partition Labels/README_EN.md | 2 ++ .../0764.Largest Plus Sign/README.md | 2 ++ .../0764.Largest Plus Sign/README_EN.md | 2 ++ .../0765.Couples Holding Hands/README.md | 2 ++ .../0765.Couples Holding Hands/README_EN.md | 2 ++ .../0700-0799/0766.Toeplitz Matrix/README.md | 2 ++ .../0766.Toeplitz Matrix/README_EN.md | 2 ++ .../0767.Reorganize String/README.md | 2 ++ .../0767.Reorganize String/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0769.Max Chunks To Make Sorted/README.md | 2 ++ .../README_EN.md | 2 ++ .../0770.Basic Calculator IV/README.md | 2 ++ .../0770.Basic Calculator IV/README_EN.md | 2 ++ .../0771.Jewels and Stones/README.md | 2 ++ .../0771.Jewels and Stones/README_EN.md | 2 ++ .../0772.Basic Calculator III/README.md | 2 ++ .../0772.Basic Calculator III/README_EN.md | 2 ++ .../0700-0799/0773.Sliding Puzzle/README.md | 2 ++ .../0773.Sliding Puzzle/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0700-0799/0776.Split BST/README.md | 2 ++ .../0700-0799/0776.Split BST/README_EN.md | 2 ++ .../0777.Swap Adjacent in LR String/README.md | 2 ++ .../README_EN.md | 2 ++ .../0778.Swim in Rising Water/README.md | 2 ++ .../0778.Swim in Rising Water/README_EN.md | 2 ++ .../0779.K-th Symbol in Grammar/README.md | 2 ++ .../0779.K-th Symbol in Grammar/README_EN.md | 2 ++ .../0700-0799/0780.Reaching Points/README.md | 2 ++ .../0780.Reaching Points/README_EN.md | 2 ++ .../0781.Rabbits in Forest/README.md | 2 ++ .../0781.Rabbits in Forest/README_EN.md | 2 ++ .../0782.Transform to Chessboard/README.md | 2 ++ .../0782.Transform to Chessboard/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0784.Letter Case Permutation/README.md | 2 ++ .../0784.Letter Case Permutation/README_EN.md | 2 ++ .../0785.Is Graph Bipartite/README.md | 2 ++ .../0785.Is Graph Bipartite/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0788.Rotated Digits/README.md | 2 ++ .../0788.Rotated Digits/README_EN.md | 2 ++ .../0789.Escape The Ghosts/README.md | 2 ++ .../0789.Escape The Ghosts/README_EN.md | 2 ++ .../0790.Domino and Tromino Tiling/README.md | 2 ++ .../README_EN.md | 2 ++ .../0791.Custom Sort String/README.md | 2 ++ .../0791.Custom Sort String/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0794.Valid Tic-Tac-Toe State/README.md | 2 ++ .../0794.Valid Tic-Tac-Toe State/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0796.Rotate String/README.md | 2 ++ .../0700-0799/0796.Rotate String/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0700-0799/0799.Champagne Tower/README.md | 2 ++ .../0799.Champagne Tower/README_EN.md | 2 ++ .../0800.Similar RGB Color/README.md | 2 ++ .../0800.Similar RGB Color/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0802.Find Eventual Safe States/README.md | 2 ++ .../README_EN.md | 2 ++ .../0803.Bricks Falling When Hit/README.md | 2 ++ .../0803.Bricks Falling When Hit/README_EN.md | 2 ++ .../0804.Unique Morse Code Words/README.md | 2 ++ .../0804.Unique Morse Code Words/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0800-0899/0808.Soup Servings/README.md | 2 ++ .../0800-0899/0808.Soup Servings/README_EN.md | 2 ++ .../0800-0899/0809.Expressive Words/README.md | 2 ++ .../0809.Expressive Words/README_EN.md | 2 ++ .../0810.Chalkboard XOR Game/README.md | 2 ++ .../0810.Chalkboard XOR Game/README_EN.md | 2 ++ .../0811.Subdomain Visit Count/README.md | 2 ++ .../0811.Subdomain Visit Count/README_EN.md | 2 ++ .../0812.Largest Triangle Area/README.md | 2 ++ .../0812.Largest Triangle Area/README_EN.md | 2 ++ .../0813.Largest Sum of Averages/README.md | 2 ++ .../0813.Largest Sum of Averages/README_EN.md | 2 ++ .../0814.Binary Tree Pruning/README.md | 2 ++ .../0814.Binary Tree Pruning/README_EN.md | 2 ++ solution/0800-0899/0815.Bus Routes/README.md | 2 ++ .../0800-0899/0815.Bus Routes/README_EN.md | 2 ++ .../0816.Ambiguous Coordinates/README.md | 2 ++ .../0816.Ambiguous Coordinates/README_EN.md | 2 ++ .../0817.Linked List Components/README.md | 2 ++ .../0817.Linked List Components/README_EN.md | 2 ++ solution/0800-0899/0818.Race Car/README.md | 2 ++ solution/0800-0899/0818.Race Car/README_EN.md | 2 ++ .../0800-0899/0819.Most Common Word/README.md | 2 ++ .../0819.Most Common Word/README_EN.md | 2 ++ .../0820.Short Encoding of Words/README.md | 2 ++ .../0820.Short Encoding of Words/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0822.Card Flipping Game/README.md | 2 ++ .../0822.Card Flipping Game/README_EN.md | 2 ++ .../0823.Binary Trees With Factors/README.md | 2 ++ .../README_EN.md | 2 ++ solution/0800-0899/0824.Goat Latin/README.md | 2 ++ .../0800-0899/0824.Goat Latin/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0826.Most Profit Assigning Work/README.md | 2 ++ .../README_EN.md | 2 ++ .../0827.Making A Large Island/README.md | 2 ++ .../0827.Making A Large Island/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0829.Consecutive Numbers Sum/README.md | 2 ++ .../0829.Consecutive Numbers Sum/README_EN.md | 2 ++ .../0830.Positions of Large Groups/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0832.Flipping an Image/README.md | 2 ++ .../0832.Flipping an Image/README_EN.md | 2 ++ .../0833.Find And Replace in String/README.md | 2 ++ .../README_EN.md | 2 ++ .../0834.Sum of Distances in Tree/README.md | 2 ++ .../README_EN.md | 2 ++ .../0800-0899/0835.Image Overlap/README.md | 2 ++ .../0800-0899/0835.Image Overlap/README_EN.md | 2 ++ .../0836.Rectangle Overlap/README.md | 2 ++ .../0836.Rectangle Overlap/README_EN.md | 2 ++ solution/0800-0899/0837.New 21 Game/README.md | 2 ++ .../0800-0899/0837.New 21 Game/README_EN.md | 2 ++ .../0800-0899/0838.Push Dominoes/README.md | 2 ++ .../0800-0899/0838.Push Dominoes/README_EN.md | 2 ++ .../0839.Similar String Groups/README.md | 2 ++ .../0839.Similar String Groups/README_EN.md | 2 ++ .../0840.Magic Squares In Grid/README.md | 2 ++ .../0840.Magic Squares In Grid/README_EN.md | 2 ++ .../0800-0899/0841.Keys and Rooms/README.md | 2 ++ .../0841.Keys and Rooms/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0800-0899/0843.Guess the Word/README.md | 2 ++ .../0843.Guess the Word/README_EN.md | 2 ++ .../0844.Backspace String Compare/README.md | 2 ++ .../README_EN.md | 2 ++ .../0845.Longest Mountain in Array/README.md | 2 ++ .../README_EN.md | 2 ++ .../0846.Hand of Straights/README.md | 2 ++ .../0846.Hand of Straights/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0800-0899/0848.Shifting Letters/README.md | 2 ++ .../0848.Shifting Letters/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0850.Rectangle Area II/README.md | 2 ++ .../0850.Rectangle Area II/README_EN.md | 2 ++ .../0800-0899/0851.Loud and Rich/README.md | 2 ++ .../0800-0899/0851.Loud and Rich/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/0800-0899/0853.Car Fleet/README.md | 2 ++ .../0800-0899/0853.Car Fleet/README_EN.md | 2 ++ .../0854.K-Similar Strings/README.md | 2 ++ .../0854.K-Similar Strings/README_EN.md | 2 ++ solution/0800-0899/0855.Exam Room/README.md | 2 ++ .../0800-0899/0855.Exam Room/README_EN.md | 2 ++ .../0856.Score of Parentheses/README.md | 2 ++ .../0856.Score of Parentheses/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0858.Mirror Reflection/README.md | 2 ++ .../0858.Mirror Reflection/README_EN.md | 2 ++ .../0800-0899/0859.Buddy Strings/README.md | 2 ++ .../0800-0899/0859.Buddy Strings/README_EN.md | 2 ++ .../0800-0899/0860.Lemonade Change/README.md | 2 ++ .../0860.Lemonade Change/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0800-0899/0866.Prime Palindrome/README.md | 2 ++ .../0866.Prime Palindrome/README_EN.md | 2 ++ .../0800-0899/0867.Transpose Matrix/README.md | 2 ++ .../0867.Transpose Matrix/README_EN.md | 2 ++ solution/0800-0899/0868.Binary Gap/README.md | 2 ++ .../0800-0899/0868.Binary Gap/README_EN.md | 2 ++ .../0869.Reordered Power of 2/README.md | 2 ++ .../0869.Reordered Power of 2/README_EN.md | 2 ++ .../0870.Advantage Shuffle/README.md | 2 ++ .../0870.Advantage Shuffle/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0872.Leaf-Similar Trees/README.md | 2 ++ .../0872.Leaf-Similar Trees/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0874.Walking Robot Simulation/README.md | 2 ++ .../README_EN.md | 2 ++ .../0875.Koko Eating Bananas/README.md | 2 ++ .../0875.Koko Eating Bananas/README_EN.md | 2 ++ .../0876.Middle of the Linked List/README.md | 2 ++ .../README_EN.md | 2 ++ solution/0800-0899/0877.Stone Game/README.md | 2 ++ .../0800-0899/0877.Stone Game/README_EN.md | 2 ++ .../0878.Nth Magical Number/README.md | 2 ++ .../0878.Nth Magical Number/README_EN.md | 2 ++ .../0879.Profitable Schemes/README.md | 2 ++ .../0879.Profitable Schemes/README_EN.md | 2 ++ .../0880.Decoded String at Index/README.md | 2 ++ .../0880.Decoded String at Index/README_EN.md | 2 ++ .../0881.Boats to Save People/README.md | 2 ++ .../0881.Boats to Save People/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0885.Spiral Matrix III/README.md | 2 ++ .../0885.Spiral Matrix III/README_EN.md | 2 ++ .../0886.Possible Bipartition/README.md | 2 ++ .../0886.Possible Bipartition/README_EN.md | 2 ++ .../0800-0899/0887.Super Egg Drop/README.md | 2 ++ .../0887.Super Egg Drop/README_EN.md | 2 ++ .../0800-0899/0888.Fair Candy Swap/README.md | 2 ++ .../0888.Fair Candy Swap/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0890.Find and Replace Pattern/README.md | 2 ++ .../README_EN.md | 2 ++ .../0891.Sum of Subsequence Widths/README.md | 2 ++ .../README_EN.md | 2 ++ .../0892.Surface Area of 3D Shapes/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0895.Maximum Frequency Stack/README.md | 2 ++ .../0895.Maximum Frequency Stack/README_EN.md | 2 ++ .../0800-0899/0896.Monotonic Array/README.md | 2 ++ .../0896.Monotonic Array/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0898.Bitwise ORs of Subarrays/README.md | 2 ++ .../README_EN.md | 2 ++ .../0800-0899/0899.Orderly Queue/README.md | 2 ++ .../0800-0899/0899.Orderly Queue/README_EN.md | 2 ++ .../0900-0999/0900.RLE Iterator/README.md | 2 ++ .../0900-0999/0900.RLE Iterator/README_EN.md | 2 ++ .../0901.Online Stock Span/README.md | 2 ++ .../0901.Online Stock Span/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0904.Fruit Into Baskets/README.md | 2 ++ .../0904.Fruit Into Baskets/README_EN.md | 2 ++ .../0905.Sort Array By Parity/README.md | 2 ++ .../0905.Sort Array By Parity/README_EN.md | 2 ++ .../0906.Super Palindromes/README.md | 2 ++ .../0906.Super Palindromes/README_EN.md | 2 ++ .../0907.Sum of Subarray Minimums/README.md | 2 ++ .../README_EN.md | 2 ++ .../0900-0999/0908.Smallest Range I/README.md | 2 ++ .../0908.Smallest Range I/README_EN.md | 2 ++ .../0909.Snakes and Ladders/README.md | 2 ++ .../0909.Snakes and Ladders/README_EN.md | 2 ++ .../0910.Smallest Range II/README.md | 2 ++ .../0910.Smallest Range II/README_EN.md | 2 ++ .../0900-0999/0911.Online Election/README.md | 2 ++ .../0911.Online Election/README_EN.md | 2 ++ .../0900-0999/0912.Sort an Array/README.md | 2 ++ .../0900-0999/0912.Sort an Array/README_EN.md | 2 ++ .../0900-0999/0913.Cat and Mouse/README.md | 2 ++ .../0900-0999/0913.Cat and Mouse/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0900-0999/0916.Word Subsets/README.md | 2 ++ .../0900-0999/0916.Word Subsets/README_EN.md | 2 ++ .../0917.Reverse Only Letters/README.md | 2 ++ .../0917.Reverse Only Letters/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0920.Number of Music Playlists/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0922.Sort Array By Parity II/README.md | 2 ++ .../0922.Sort Array By Parity II/README_EN.md | 2 ++ .../0923.3Sum With Multiplicity/README.md | 2 ++ .../0923.3Sum With Multiplicity/README_EN.md | 2 ++ .../0924.Minimize Malware Spread/README.md | 2 ++ .../0924.Minimize Malware Spread/README_EN.md | 2 ++ .../0925.Long Pressed Name/README.md | 2 ++ .../0925.Long Pressed Name/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0927.Three Equal Parts/README.md | 2 ++ .../0927.Three Equal Parts/README_EN.md | 2 ++ .../0928.Minimize Malware Spread II/README.md | 2 ++ .../README_EN.md | 2 ++ .../0929.Unique Email Addresses/README.md | 2 ++ .../0929.Unique Email Addresses/README_EN.md | 2 ++ .../0930.Binary Subarrays With Sum/README.md | 2 ++ .../README_EN.md | 2 ++ .../0931.Minimum Falling Path Sum/README.md | 2 ++ .../README_EN.md | 2 ++ .../0900-0999/0932.Beautiful Array/README.md | 2 ++ .../0932.Beautiful Array/README_EN.md | 2 ++ .../0933.Number of Recent Calls/README.md | 2 ++ .../0933.Number of Recent Calls/README_EN.md | 2 ++ .../0900-0999/0934.Shortest Bridge/README.md | 2 ++ .../0934.Shortest Bridge/README_EN.md | 2 ++ .../0900-0999/0935.Knight Dialer/README.md | 2 ++ .../0900-0999/0935.Knight Dialer/README_EN.md | 2 ++ .../0936.Stamping The Sequence/README.md | 2 ++ .../0936.Stamping The Sequence/README_EN.md | 2 ++ .../0937.Reorder Data in Log Files/README.md | 2 ++ .../README_EN.md | 2 ++ .../0900-0999/0938.Range Sum of BST/README.md | 2 ++ .../0938.Range Sum of BST/README_EN.md | 2 ++ .../0939.Minimum Area Rectangle/README.md | 2 ++ .../0939.Minimum Area Rectangle/README_EN.md | 2 ++ .../0940.Distinct Subsequences II/README.md | 2 ++ .../README_EN.md | 2 ++ .../0941.Valid Mountain Array/README.md | 2 ++ .../0941.Valid Mountain Array/README_EN.md | 2 ++ .../0900-0999/0942.DI String Match/README.md | 2 ++ .../0942.DI String Match/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0946.Validate Stack Sequences/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0900-0999/0948.Bag of Tokens/README.md | 2 ++ .../0900-0999/0948.Bag of Tokens/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0954.Array of Doubled Pairs/README.md | 2 ++ .../0954.Array of Doubled Pairs/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0956.Tallest Billboard/README.md | 2 ++ .../0956.Tallest Billboard/README_EN.md | 2 ++ .../0957.Prison Cells After N Days/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0959.Regions Cut By Slashes/README.md | 2 ++ .../0959.Regions Cut By Slashes/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0962.Maximum Width Ramp/README.md | 2 ++ .../0962.Maximum Width Ramp/README_EN.md | 2 ++ .../0963.Minimum Area Rectangle II/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0965.Univalued Binary Tree/README.md | 2 ++ .../0965.Univalued Binary Tree/README_EN.md | 2 ++ .../0966.Vowel Spellchecker/README.md | 2 ++ .../0966.Vowel Spellchecker/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0968.Binary Tree Cameras/README.md | 2 ++ .../0968.Binary Tree Cameras/README_EN.md | 2 ++ .../0900-0999/0969.Pancake Sorting/README.md | 2 ++ .../0969.Pancake Sorting/README_EN.md | 2 ++ .../0970.Powerful Integers/README.md | 2 ++ .../0970.Powerful Integers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0972.Equal Rational Numbers/README.md | 2 ++ .../0972.Equal Rational Numbers/README_EN.md | 2 ++ .../0973.K Closest Points to Origin/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0900-0999/0975.Odd Even Jump/README.md | 2 ++ .../0900-0999/0975.Odd Even Jump/README_EN.md | 2 ++ .../0976.Largest Perimeter Triangle/README.md | 2 ++ .../README_EN.md | 2 ++ .../0977.Squares of a Sorted Array/README.md | 2 ++ .../README_EN.md | 2 ++ .../0978.Longest Turbulent Subarray/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0900-0999/0980.Unique Paths III/README.md | 2 ++ .../0980.Unique Paths III/README_EN.md | 2 ++ .../0981.Time Based Key-Value Store/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0983.Minimum Cost For Tickets/README.md | 2 ++ .../README_EN.md | 2 ++ .../0984.String Without AAA or BBB/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0991.Broken Calculator/README.md | 2 ++ .../0991.Broken Calculator/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0993.Cousins in Binary Tree/README.md | 2 ++ .../0993.Cousins in Binary Tree/README_EN.md | 2 ++ .../0900-0999/0994.Rotting Oranges/README.md | 2 ++ .../0994.Rotting Oranges/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../0996.Number of Squareful Arrays/README.md | 2 ++ .../README_EN.md | 2 ++ .../0997.Find the Town Judge/README.md | 2 ++ .../0997.Find the Town Judge/README_EN.md | 2 ++ .../0998.Maximum Binary Tree II/README.md | 2 ++ .../0998.Maximum Binary Tree II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1001.Grid Illumination/README.md | 2 ++ .../1001.Grid Illumination/README_EN.md | 2 ++ .../1002.Find Common Characters/README.md | 2 ++ .../1002.Find Common Characters/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1004.Max Consecutive Ones III/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1000-1099/1006.Clumsy Factorial/README.md | 2 ++ .../1006.Clumsy Factorial/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1014.Best Sightseeing Pair/README.md | 2 ++ .../1014.Best Sightseeing Pair/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1017.Convert to Base -2/README.md | 2 ++ .../1017.Convert to Base -2/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1020.Number of Enclaves/README.md | 2 ++ .../1020.Number of Enclaves/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1023.Camelcase Matching/README.md | 2 ++ .../1023.Camelcase Matching/README_EN.md | 2 ++ .../1000-1099/1024.Video Stitching/README.md | 2 ++ .../1024.Video Stitching/README_EN.md | 2 ++ .../1000-1099/1025.Divisor Game/README.md | 2 ++ .../1000-1099/1025.Divisor Game/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1029.Two City Scheduling/README.md | 2 ++ .../1029.Two City Scheduling/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1032.Stream of Characters/README.md | 2 ++ .../1032.Stream of Characters/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1034.Coloring A Border/README.md | 2 ++ .../1034.Coloring A Border/README_EN.md | 2 ++ .../1000-1099/1035.Uncrossed Lines/README.md | 2 ++ .../1035.Uncrossed Lines/README_EN.md | 2 ++ .../1036.Escape a Large Maze/README.md | 2 ++ .../1036.Escape a Large Maze/README_EN.md | 2 ++ .../1000-1099/1037.Valid Boomerang/README.md | 2 ++ .../1037.Valid Boomerang/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1041.Robot Bounded In Circle/README.md | 2 ++ .../1041.Robot Bounded In Circle/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1046.Last Stone Weight/README.md | 2 ++ .../1046.Last Stone Weight/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1048.Longest String Chain/README.md | 2 ++ .../1048.Longest String Chain/README_EN.md | 2 ++ .../1049.Last Stone Weight II/README.md | 2 ++ .../1049.Last Stone Weight II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1000-1099/1051.Height Checker/README.md | 2 ++ .../1051.Height Checker/README_EN.md | 2 ++ .../1052.Grumpy Bookstore Owner/README.md | 2 ++ .../1052.Grumpy Bookstore Owner/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1000-1099/1054.Distant Barcodes/README.md | 2 ++ .../1054.Distant Barcodes/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1000-1099/1056.Confusing Number/README.md | 2 ++ .../1056.Confusing Number/README_EN.md | 2 ++ .../1000-1099/1057.Campus Bikes/README.md | 2 ++ .../1000-1099/1057.Campus Bikes/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1063.Number of Valid Subarrays/README.md | 2 ++ .../README_EN.md | 2 ++ solution/1000-1099/1064.Fixed Point/README.md | 2 ++ .../1000-1099/1064.Fixed Point/README_EN.md | 2 ++ .../1065.Index Pairs of a String/README.md | 2 ++ .../1065.Index Pairs of a String/README_EN.md | 2 ++ .../1000-1099/1066.Campus Bikes II/README.md | 2 ++ .../1066.Campus Bikes II/README_EN.md | 2 ++ .../1067.Digit Count in Range/README.md | 2 ++ .../1067.Digit Count in Range/README_EN.md | 2 ++ .../1068.Product Sales Analysis I/README.md | 2 ++ .../README_EN.md | 2 ++ .../1069.Product Sales Analysis II/README.md | 2 ++ .../README_EN.md | 2 ++ .../1070.Product Sales Analysis III/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1075.Project Employees I/README.md | 2 ++ .../1075.Project Employees I/README_EN.md | 2 ++ .../1076.Project Employees II/README.md | 2 ++ .../1076.Project Employees II/README_EN.md | 2 ++ .../1077.Project Employees III/README.md | 2 ++ .../1077.Project Employees III/README_EN.md | 2 ++ .../1078.Occurrences After Bigram/README.md | 2 ++ .../README_EN.md | 2 ++ .../1079.Letter Tile Possibilities/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1000-1099/1082.Sales Analysis I/README.md | 2 ++ .../1082.Sales Analysis I/README_EN.md | 2 ++ .../1083.Sales Analysis II/README.md | 2 ++ .../1083.Sales Analysis II/README_EN.md | 2 ++ .../1084.Sales Analysis III/README.md | 2 ++ .../1084.Sales Analysis III/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/1000-1099/1086.High Five/README.md | 2 ++ .../1000-1099/1086.High Five/README_EN.md | 2 ++ .../1000-1099/1087.Brace Expansion/README.md | 2 ++ .../1087.Brace Expansion/README_EN.md | 2 ++ .../1088.Confusing Number II/README.md | 2 ++ .../1088.Confusing Number II/README_EN.md | 2 ++ .../1000-1099/1089.Duplicate Zeros/README.md | 2 ++ .../1089.Duplicate Zeros/README_EN.md | 2 ++ .../1090.Largest Values From Labels/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/1000-1099/1094.Car Pooling/README.md | 2 ++ .../1000-1099/1094.Car Pooling/README_EN.md | 2 ++ .../1095.Find in Mountain Array/README.md | 2 ++ .../1095.Find in Mountain Array/README_EN.md | 2 ++ .../1096.Brace Expansion II/README.md | 2 ++ .../1096.Brace Expansion II/README_EN.md | 2 ++ .../1097.Game Play Analysis V/README.md | 2 ++ .../1097.Game Play Analysis V/README_EN.md | 2 ++ .../1000-1099/1098.Unpopular Books/README.md | 2 ++ .../1098.Unpopular Books/README_EN.md | 2 ++ .../1099.Two Sum Less Than K/README.md | 2 ++ .../1099.Two Sum Less Than K/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1105.Filling Bookcase Shelves/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1107.New Users Daily Count/README.md | 2 ++ .../1107.New Users Daily Count/README_EN.md | 2 ++ .../1108.Defanging an IP Address/README.md | 2 ++ .../1108.Defanging an IP Address/README_EN.md | 2 ++ .../1109.Corporate Flight Bookings/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1100-1199/1113.Reported Posts/README.md | 2 ++ .../1113.Reported Posts/README_EN.md | 2 ++ .../1100-1199/1114.Print in Order/README.md | 2 ++ .../1114.Print in Order/README_EN.md | 2 ++ .../1115.Print FooBar Alternately/README.md | 2 ++ .../README_EN.md | 2 ++ .../1116.Print Zero Even Odd/README.md | 2 ++ .../1116.Print Zero Even Odd/README_EN.md | 2 ++ .../1100-1199/1117.Building H2O/README.md | 2 ++ .../1100-1199/1117.Building H2O/README_EN.md | 2 ++ .../1118.Number of Days in a Month/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1120.Maximum Average Subtree/README.md | 2 ++ .../1120.Maximum Average Subtree/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1122.Relative Sort Array/README.md | 2 ++ .../1122.Relative Sort Array/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1125.Smallest Sufficient Team/README.md | 2 ++ .../README_EN.md | 2 ++ .../1126.Active Businesses/README.md | 2 ++ .../1126.Active Businesses/README_EN.md | 2 ++ .../1127.User Purchase Platform/README.md | 2 ++ .../1127.User Purchase Platform/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1132.Reported Posts II/README.md | 2 ++ .../1132.Reported Posts II/README_EN.md | 2 ++ .../1133.Largest Unique Number/README.md | 2 ++ .../1133.Largest Unique Number/README_EN.md | 2 ++ .../1100-1199/1134.Armstrong Number/README.md | 2 ++ .../1134.Armstrong Number/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1100-1199/1136.Parallel Courses/README.md | 2 ++ .../1136.Parallel Courses/README_EN.md | 2 ++ .../1137.N-th Tribonacci Number/README.md | 2 ++ .../1137.N-th Tribonacci Number/README_EN.md | 2 ++ .../1138.Alphabet Board Path/README.md | 2 ++ .../1138.Alphabet Board Path/README_EN.md | 2 ++ .../1139.Largest 1-Bordered Square/README.md | 2 ++ .../README_EN.md | 2 ++ .../1100-1199/1140.Stone Game II/README.md | 2 ++ .../1100-1199/1140.Stone Game II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1143.Longest Common Subsequence/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1145.Binary Tree Coloring Game/README.md | 2 ++ .../README_EN.md | 2 ++ .../1100-1199/1146.Snapshot Array/README.md | 2 ++ .../1146.Snapshot Array/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1100-1199/1148.Article Views I/README.md | 2 ++ .../1148.Article Views I/README_EN.md | 2 ++ .../1100-1199/1149.Article Views II/README.md | 2 ++ .../1149.Article Views II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1100-1199/1154.Day of the Year/README.md | 2 ++ .../1154.Day of the Year/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1158.Market Analysis I/README.md | 2 ++ .../1158.Market Analysis I/README_EN.md | 2 ++ .../1159.Market Analysis II/README.md | 2 ++ .../1159.Market Analysis II/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1165.Single-Row Keyboard/README.md | 2 ++ .../1165.Single-Row Keyboard/README_EN.md | 2 ++ .../1166.Design File System/README.md | 2 ++ .../1166.Design File System/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1169.Invalid Transactions/README.md | 2 ++ .../1169.Invalid Transactions/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1172.Dinner Plate Stacks/README.md | 2 ++ .../1172.Dinner Plate Stacks/README_EN.md | 2 ++ .../1173.Immediate Food Delivery I/README.md | 2 ++ .../README_EN.md | 2 ++ .../1174.Immediate Food Delivery II/README.md | 2 ++ .../README_EN.md | 2 ++ .../1175.Prime Arrangements/README.md | 2 ++ .../1175.Prime Arrangements/README_EN.md | 2 ++ .../1176.Diet Plan Performance/README.md | 2 ++ .../1176.Diet Plan Performance/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1179.Reformat Department Table/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1181.Before and After Puzzle/README.md | 2 ++ .../1181.Before and After Puzzle/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1183.Maximum Number of Ones/README.md | 2 ++ .../1183.Maximum Number of Ones/README_EN.md | 2 ++ .../1184.Distance Between Bus Stops/README.md | 2 ++ .../README_EN.md | 2 ++ .../1100-1199/1185.Day of the Week/README.md | 2 ++ .../1185.Day of the Week/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1189.Maximum Number of Balloons/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1193.Monthly Transactions I/README.md | 2 ++ .../1193.Monthly Transactions I/README_EN.md | 2 ++ .../1194.Tournament Winners/README.md | 2 ++ .../1194.Tournament Winners/README_EN.md | 2 ++ .../1195.Fizz Buzz Multithreaded/README.md | 2 ++ .../1195.Fizz Buzz Multithreaded/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1197.Minimum Knight Moves/README.md | 2 ++ .../1197.Minimum Knight Moves/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1200-1299/1201.Ugly Number III/README.md | 2 ++ .../1201.Ugly Number III/README_EN.md | 2 ++ .../1202.Smallest String With Swaps/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1205.Monthly Transactions II/README.md | 2 ++ .../1205.Monthly Transactions II/README_EN.md | 2 ++ .../1200-1299/1206.Design Skiplist/README.md | 2 ++ .../1206.Design Skiplist/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1200-1299/1214.Two Sum BSTs/README.md | 2 ++ .../1200-1299/1214.Two Sum BSTs/README_EN.md | 2 ++ .../1200-1299/1215.Stepping Numbers/README.md | 2 ++ .../1215.Stepping Numbers/README_EN.md | 2 ++ .../1216.Valid Palindrome III/README.md | 2 ++ .../1216.Valid Palindrome III/README_EN.md | 2 ++ .../1200-1299/1217.Play with Chips/README.md | 2 ++ .../1217.Play with Chips/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1219.Path with Maximum Gold/README.md | 2 ++ .../1219.Path with Maximum Gold/README_EN.md | 2 ++ .../1220.Count Vowels Permutation/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1223.Dice Roll Simulation/README.md | 2 ++ .../1223.Dice Roll Simulation/README_EN.md | 2 ++ .../1224.Maximum Equal Frequency/README.md | 2 ++ .../1224.Maximum Equal Frequency/README_EN.md | 2 ++ .../1225.Report Contiguous Dates/README.md | 2 ++ .../1225.Report Contiguous Dates/README_EN.md | 2 ++ .../1226.The Dining Philosophers/README.md | 2 ++ .../1226.The Dining Philosophers/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1229.Meeting Scheduler/README.md | 2 ++ .../1229.Meeting Scheduler/README_EN.md | 2 ++ .../1230.Toss Strange Coins/README.md | 2 ++ .../1230.Toss Strange Coins/README_EN.md | 2 ++ .../1200-1299/1231.Divide Chocolate/README.md | 2 ++ .../1231.Divide Chocolate/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/1200-1299/1236.Web Crawler/README.md | 2 ++ .../1200-1299/1236.Web Crawler/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1242.Web Crawler Multithreaded/README.md | 2 ++ .../README_EN.md | 2 ++ .../1243.Array Transformation/README.md | 2 ++ .../1243.Array Transformation/README_EN.md | 2 ++ .../1244.Design A Leaderboard/README.md | 2 ++ .../1244.Design A Leaderboard/README_EN.md | 2 ++ .../1200-1299/1245.Tree Diameter/README.md | 2 ++ .../1200-1299/1245.Tree Diameter/README_EN.md | 2 ++ .../1246.Palindrome Removal/README.md | 2 ++ .../1246.Palindrome Removal/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1251.Average Selling Price/README.md | 2 ++ .../1251.Average Selling Price/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1254.Number of Closed Islands/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1200-1299/1256.Encode Number/README.md | 2 ++ .../1200-1299/1256.Encode Number/README_EN.md | 2 ++ .../1257.Smallest Common Region/README.md | 2 ++ .../1257.Smallest Common Region/README_EN.md | 2 ++ .../1258.Synonymous Sentences/README.md | 2 ++ .../1258.Synonymous Sentences/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1200-1299/1260.Shift 2D Grid/README.md | 2 ++ .../1200-1299/1260.Shift 2D Grid/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1264.Page Recommendations/README.md | 2 ++ .../1264.Page Recommendations/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1268.Search Suggestions System/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/1200-1299/1271.Hexspeak/README.md | 2 ++ solution/1200-1299/1271.Hexspeak/README_EN.md | 2 ++ .../1200-1299/1272.Remove Interval/README.md | 2 ++ .../1272.Remove Interval/README_EN.md | 2 ++ .../1273.Delete Tree Nodes/README.md | 2 ++ .../1273.Delete Tree Nodes/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1280.Students and Examinations/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1286.Iterator for Combination/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1288.Remove Covered Intervals/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1291.Sequential Digits/README.md | 2 ++ .../1291.Sequential Digits/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1302.Deepest Leaves Sum/README.md | 2 ++ .../1302.Deepest Leaves Sum/README_EN.md | 2 ++ .../1303.Find the Team Size/README.md | 2 ++ .../1303.Find the Team Size/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1300-1399/1306.Jump Game III/README.md | 2 ++ .../1300-1399/1306.Jump Game III/README_EN.md | 2 ++ .../1307.Verbal Arithmetic Puzzle/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1310.XOR Queries of a Subarray/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1300-1399/1314.Matrix Block Sum/README.md | 2 ++ .../1314.Matrix Block Sum/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1316.Distinct Echo Substrings/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1321.Restaurant Growth/README.md | 2 ++ .../1321.Restaurant Growth/README_EN.md | 2 ++ .../1300-1399/1322.Ads Performance/README.md | 2 ++ .../1322.Ads Performance/README_EN.md | 2 ++ .../1323.Maximum 69 Number/README.md | 2 ++ .../1323.Maximum 69 Number/README_EN.md | 2 ++ .../1324.Print Words Vertically/README.md | 2 ++ .../1324.Print Words Vertically/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1328.Break a Palindrome/README.md | 2 ++ .../1328.Break a Palindrome/README_EN.md | 2 ++ .../1329.Sort the Matrix Diagonally/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1331.Rank Transform of an Array/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ solution/1300-1399/1340.Jump Game V/README.md | 2 ++ .../1300-1399/1340.Jump Game V/README_EN.md | 2 ++ .../1300-1399/1341.Movie Rating/README.md | 2 ++ .../1300-1399/1341.Movie Rating/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1300-1399/1345.Jump Game IV/README.md | 2 ++ .../1300-1399/1345.Jump Game IV/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1348.Tweet Counts Per Frequency/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1355.Activity Participants/README.md | 2 ++ .../1355.Activity Participants/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1361.Validate Binary Tree Nodes/README.md | 2 ++ .../README_EN.md | 2 ++ .../1300-1399/1362.Closest Divisors/README.md | 2 ++ .../1362.Closest Divisors/README_EN.md | 2 ++ .../1363.Largest Multiple of Three/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1366.Rank Teams by Votes/README.md | 2 ++ .../1366.Rank Teams by Votes/README_EN.md | 2 ++ .../1367.Linked List in Binary Tree/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1375.Bulb Switcher III/README.md | 2 ++ .../1375.Bulb Switcher III/README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../1380.Lucky Numbers in a Matrix/README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 2 ++ .../README_EN.md | 2 ++ 2767 files changed, 5561 insertions(+) create mode 100644 solution/0100-0199/test.py diff --git a/solution/0000-0099/0001.Two Sum/README.md b/solution/0000-0099/0001.Two Sum/README.md index c0f4dda846516..0e280211b3587 100644 --- a/solution/0000-0099/0001.Two Sum/README.md +++ b/solution/0000-0099/0001.Two Sum/README.md @@ -1,5 +1,7 @@ # [1. 两数之和](https://leetcode-cn.com/problems/two-sum) +[English Version](/solution/0000-0099/0001.Two%20Sum/README_EN.md) + ## 题目描述

给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。

diff --git a/solution/0000-0099/0001.Two Sum/README_EN.md b/solution/0000-0099/0001.Two Sum/README_EN.md index 2c271bda04edc..8d23996b11136 100644 --- a/solution/0000-0099/0001.Two Sum/README_EN.md +++ b/solution/0000-0099/0001.Two Sum/README_EN.md @@ -1,5 +1,7 @@ # [1. Two Sum](https://leetcode.com/problems/two-sum) +[中文文档](/solution/0000-0099/0001.Two%20Sum/README.md) + ## Description

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

diff --git a/solution/0000-0099/0002.Add Two Numbers/README.md b/solution/0000-0099/0002.Add Two Numbers/README.md index 15e706a2f7732..70f6c30985c53 100644 --- a/solution/0000-0099/0002.Add Two Numbers/README.md +++ b/solution/0000-0099/0002.Add Two Numbers/README.md @@ -1,5 +1,7 @@ # [2. 两数相加](https://leetcode-cn.com/problems/add-two-numbers) +[English Version](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md) + ## 题目描述

给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。

diff --git a/solution/0000-0099/0002.Add Two Numbers/README_EN.md b/solution/0000-0099/0002.Add Two Numbers/README_EN.md index 7256d676f3c31..09a5852db512b 100644 --- a/solution/0000-0099/0002.Add Two Numbers/README_EN.md +++ b/solution/0000-0099/0002.Add Two Numbers/README_EN.md @@ -1,5 +1,7 @@ # [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers) +[中文文档](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md) + ## Description

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md index a20e183634c6a..7027001bc5d8f 100644 --- a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md +++ b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md @@ -1,5 +1,7 @@ # [3. 无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters) +[English Version](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md) + ## 题目描述

给定一个字符串，请你找出其中不含有重复字符的 最长子串 的长度。

diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md index 33f69939fe1ba..0ceea987a2322 100644 --- a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md +++ b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md @@ -1,5 +1,7 @@ # [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) +[中文文档](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md) + ## Description

Given a string, find the length of the longest substring without repeating characters.

diff --git a/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md b/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md index 2808907c523ad..74f30e643f9f4 100644 --- a/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md +++ b/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md @@ -1,5 +1,7 @@ # [4. 寻找两个有序数组的中位数](https://leetcode-cn.com/problems/median-of-two-sorted-arrays) +[English Version](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README_EN.md) + ## 题目描述

给定两个大小为 m 和 n 的有序数组 nums1 和 nums2。

diff --git a/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md b/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md index 98f037fcc010d..6f6a10cc58866 100644 --- a/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md +++ b/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md @@ -1,5 +1,7 @@ # [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) +[中文文档](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md) + ## Description

There are two sorted arrays nums1 and nums2 of size m and n respectively.

diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/README.md b/solution/0000-0099/0005.Longest Palindromic Substring/README.md index 2f43c70f3d33b..2494e18204624 100644 --- a/solution/0000-0099/0005.Longest Palindromic Substring/README.md +++ b/solution/0000-0099/0005.Longest Palindromic Substring/README.md @@ -1,5 +1,7 @@ # [5. 最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring) +[English Version](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md) + ## 题目描述

给定一个字符串 s，找到 s 中最长的回文子串。你可以假设 s 的最大长度为 1000。

diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md b/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md index 3984d4f073a18..5b9946636e22a 100644 --- a/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md +++ b/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md @@ -1,5 +1,7 @@ # [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) +[中文文档](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md) + ## Description

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

diff --git a/solution/0000-0099/0006.ZigZag Conversion/README.md b/solution/0000-0099/0006.ZigZag Conversion/README.md index 917126b766c1c..245ce933c43a9 100644 --- a/solution/0000-0099/0006.ZigZag Conversion/README.md +++ b/solution/0000-0099/0006.ZigZag Conversion/README.md @@ -1,5 +1,7 @@ # [6. Z 字形变换](https://leetcode-cn.com/problems/zigzag-conversion) +[English Version](/solution/0000-0099/0006.ZigZag%20Conversion/README_EN.md) + ## 题目描述

将一个给定字符串根据给定的行数，以从上往下、从左到右进行 Z 字形排列。

diff --git a/solution/0000-0099/0006.ZigZag Conversion/README_EN.md b/solution/0000-0099/0006.ZigZag Conversion/README_EN.md index 40532a2e530b1..f32fb59e184d9 100644 --- a/solution/0000-0099/0006.ZigZag Conversion/README_EN.md +++ b/solution/0000-0099/0006.ZigZag Conversion/README_EN.md @@ -1,5 +1,7 @@ # [6. ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) +[中文文档](/solution/0000-0099/0006.ZigZag%20Conversion/README.md) + ## Description

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)

diff --git a/solution/0000-0099/0007.Reverse Integer/README.md b/solution/0000-0099/0007.Reverse Integer/README.md index 3fb696970e238..06091abaf2e54 100644 --- a/solution/0000-0099/0007.Reverse Integer/README.md +++ b/solution/0000-0099/0007.Reverse Integer/README.md @@ -1,5 +1,7 @@ # [7. 整数反转](https://leetcode-cn.com/problems/reverse-integer) +[English Version](/solution/0000-0099/0007.Reverse%20Integer/README_EN.md) + ## 题目描述

给出一个 32 位的有符号整数，你需要将这个整数中每位上的数字进行反转。

diff --git a/solution/0000-0099/0007.Reverse Integer/README_EN.md b/solution/0000-0099/0007.Reverse Integer/README_EN.md index 08e759363f9b9..da7bfd8b4cf44 100644 --- a/solution/0000-0099/0007.Reverse Integer/README_EN.md +++ b/solution/0000-0099/0007.Reverse Integer/README_EN.md @@ -1,5 +1,7 @@ # [7. Reverse Integer](https://leetcode.com/problems/reverse-integer) +[中文文档](/solution/0000-0099/0007.Reverse%20Integer/README.md) + ## Description

Given a 32-bit signed integer, reverse digits of an integer.

diff --git a/solution/0000-0099/0008.String to Integer (atoi)/README.md b/solution/0000-0099/0008.String to Integer (atoi)/README.md index 210408fb51574..bd29bd8c93021 100644 --- a/solution/0000-0099/0008.String to Integer (atoi)/README.md +++ b/solution/0000-0099/0008.String to Integer (atoi)/README.md @@ -1,5 +1,7 @@ # [8. 字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi) +[English Version](/solution/0000-0099/0008.String%20to%20Integer%20(atoi)/README_EN.md) + ## 题目描述

请你来实现一个 atoi 函数，使其能将字符串转换成整数。

diff --git a/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md b/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md index 305c3fe0d167d..1f16a5e14f5b7 100644 --- a/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md +++ b/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md @@ -1,5 +1,7 @@ # [8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) +[中文文档](/solution/0000-0099/0008.String%20to%20Integer%20(atoi)/README.md) + ## Description

Implement atoi which converts a string to an integer.

diff --git a/solution/0000-0099/0009.Palindrome Number/README.md b/solution/0000-0099/0009.Palindrome Number/README.md index b3afae2eef0d7..dd05c3bf9ae9e 100644 --- a/solution/0000-0099/0009.Palindrome Number/README.md +++ b/solution/0000-0099/0009.Palindrome Number/README.md @@ -1,5 +1,7 @@ # [9. 回文数](https://leetcode-cn.com/problems/palindrome-number) +[English Version](/solution/0000-0099/0009.Palindrome%20Number/README_EN.md) + ## 题目描述

判断一个整数是否是回文数。回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。

diff --git a/solution/0000-0099/0009.Palindrome Number/README_EN.md b/solution/0000-0099/0009.Palindrome Number/README_EN.md index bb8bb82dbdc67..3df96110092cb 100644 --- a/solution/0000-0099/0009.Palindrome Number/README_EN.md +++ b/solution/0000-0099/0009.Palindrome Number/README_EN.md @@ -1,5 +1,7 @@ # [9. Palindrome Number](https://leetcode.com/problems/palindrome-number) +[中文文档](/solution/0000-0099/0009.Palindrome%20Number/README.md) + ## Description

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

diff --git a/solution/0000-0099/0010.Regular Expression Matching/README.md b/solution/0000-0099/0010.Regular Expression Matching/README.md index eb863791b609b..66bb2efc1fe86 100644 --- a/solution/0000-0099/0010.Regular Expression Matching/README.md +++ b/solution/0000-0099/0010.Regular Expression Matching/README.md @@ -1,5 +1,7 @@ # [10. 正则表达式匹配](https://leetcode-cn.com/problems/regular-expression-matching) +[English Version](/solution/0000-0099/0010.Regular%20Expression%20Matching/README_EN.md) + ## 题目描述

给你一个字符串 s 和一个字符规律 p，请你来实现一个支持 '.' 和 '*' 的正则表达式匹配。

diff --git a/solution/0000-0099/0010.Regular Expression Matching/README_EN.md b/solution/0000-0099/0010.Regular Expression Matching/README_EN.md index f2a416c636ac1..3372431f10082 100644 --- a/solution/0000-0099/0010.Regular Expression Matching/README_EN.md +++ b/solution/0000-0099/0010.Regular Expression Matching/README_EN.md @@ -1,5 +1,7 @@ # [10. Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) +[中文文档](/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md) + ## Description

Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.

diff --git a/solution/0000-0099/0011.Container With Most Water/README.md b/solution/0000-0099/0011.Container With Most Water/README.md index 62f346e0d5773..0fdd1b6f459b3 100644 --- a/solution/0000-0099/0011.Container With Most Water/README.md +++ b/solution/0000-0099/0011.Container With Most Water/README.md @@ -1,5 +1,7 @@ # [11. 盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water) +[English Version](/solution/0000-0099/0011.Container%20With%20Most%20Water/README_EN.md) + ## 题目描述

给你 n 个非负整数 a1，a2，...，an，每个数代表坐标中的一个点 (i, ai) 。在坐标内画 n 条垂直线，垂直线 i 的两个端点分别为 (i, ai) 和 (i, 0)。找出其中的两条线，使得它们与 x 轴共同构成的容器可以容纳最多的水。

diff --git a/solution/0000-0099/0011.Container With Most Water/README_EN.md b/solution/0000-0099/0011.Container With Most Water/README_EN.md index 4c66c7bf641d4..d0f2e285359e1 100644 --- a/solution/0000-0099/0011.Container With Most Water/README_EN.md +++ b/solution/0000-0099/0011.Container With Most Water/README_EN.md @@ -1,5 +1,7 @@ # [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water) +[中文文档](/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md) + ## Description

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

diff --git a/solution/0000-0099/0012.Integer to Roman/README.md b/solution/0000-0099/0012.Integer to Roman/README.md index 8e8611aef0ed5..a213e903e950c 100644 --- a/solution/0000-0099/0012.Integer to Roman/README.md +++ b/solution/0000-0099/0012.Integer to Roman/README.md @@ -1,5 +1,7 @@ # [12. 整数转罗马数字](https://leetcode-cn.com/problems/integer-to-roman) +[English Version](/solution/0000-0099/0012.Integer%20to%20Roman/README_EN.md) + ## 题目描述

罗马数字包含以下七种字符： I， V， X， L，C，D 和 M。

diff --git a/solution/0000-0099/0012.Integer to Roman/README_EN.md b/solution/0000-0099/0012.Integer to Roman/README_EN.md index b3d836dd8c70b..c240afc6ba4e8 100644 --- a/solution/0000-0099/0012.Integer to Roman/README_EN.md +++ b/solution/0000-0099/0012.Integer to Roman/README_EN.md @@ -1,5 +1,7 @@ # [12. Integer to Roman](https://leetcode.com/problems/integer-to-roman) +[中文文档](/solution/0000-0099/0012.Integer%20to%20Roman/README.md) + ## Description

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

diff --git a/solution/0000-0099/0013.Roman to Integer/README.md b/solution/0000-0099/0013.Roman to Integer/README.md index cc819a55c32f5..d396d85b0298a 100644 --- a/solution/0000-0099/0013.Roman to Integer/README.md +++ b/solution/0000-0099/0013.Roman to Integer/README.md @@ -1,5 +1,7 @@ # [13. 罗马数字转整数](https://leetcode-cn.com/problems/roman-to-integer) +[English Version](/solution/0000-0099/0013.Roman%20to%20Integer/README_EN.md) + ## 题目描述

罗马数字包含以下七种字符: I， V， X， L，C，D 和 M。

diff --git a/solution/0000-0099/0013.Roman to Integer/README_EN.md b/solution/0000-0099/0013.Roman to Integer/README_EN.md index d3ce7b441d774..052fb1d345b72 100644 --- a/solution/0000-0099/0013.Roman to Integer/README_EN.md +++ b/solution/0000-0099/0013.Roman to Integer/README_EN.md @@ -1,5 +1,7 @@ # [13. Roman to Integer](https://leetcode.com/problems/roman-to-integer) +[中文文档](/solution/0000-0099/0013.Roman%20to%20Integer/README.md) + ## Description

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

diff --git a/solution/0000-0099/0014.Longest Common Prefix/README.md b/solution/0000-0099/0014.Longest Common Prefix/README.md index 8f0511cb34329..d48f4c5931e71 100644 --- a/solution/0000-0099/0014.Longest Common Prefix/README.md +++ b/solution/0000-0099/0014.Longest Common Prefix/README.md @@ -1,5 +1,7 @@ # [14. 最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix) +[English Version](/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md) + ## 题目描述

编写一个函数来查找字符串数组中的最长公共前缀。

diff --git a/solution/0000-0099/0014.Longest Common Prefix/README_EN.md b/solution/0000-0099/0014.Longest Common Prefix/README_EN.md index aa0f7b76bdc77..31b10d1a75cd0 100644 --- a/solution/0000-0099/0014.Longest Common Prefix/README_EN.md +++ b/solution/0000-0099/0014.Longest Common Prefix/README_EN.md @@ -1,5 +1,7 @@ # [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) +[中文文档](/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md) + ## Description

Write a function to find the longest common prefix string amongst an array of strings.

diff --git a/solution/0000-0099/0015.3Sum/README.md b/solution/0000-0099/0015.3Sum/README.md index 70ab951afa89e..0a7d4edc5cadf 100644 --- a/solution/0000-0099/0015.3Sum/README.md +++ b/solution/0000-0099/0015.3Sum/README.md @@ -1,5 +1,7 @@ # [15. 三数之和](https://leetcode-cn.com/problems/3sum) +[English Version](/solution/0000-0099/0015.3Sum/README_EN.md) + ## 题目描述

给你一个包含 n 个整数的数组 nums，判断 nums 中是否存在三个元素 a，b，c ，使得 a + b + c = 0 ？请你找出所有满足条件且不重复的三元组。

diff --git a/solution/0000-0099/0015.3Sum/README_EN.md b/solution/0000-0099/0015.3Sum/README_EN.md index 97fce6e7df5f8..c96feb3e074a4 100644 --- a/solution/0000-0099/0015.3Sum/README_EN.md +++ b/solution/0000-0099/0015.3Sum/README_EN.md @@ -1,5 +1,7 @@ # [15. 3Sum](https://leetcode.com/problems/3sum) +[中文文档](/solution/0000-0099/0015.3Sum/README.md) + ## Description

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

diff --git a/solution/0000-0099/0016.3Sum Closest/README.md b/solution/0000-0099/0016.3Sum Closest/README.md index 18ed30f04bbb1..ae636f948a890 100644 --- a/solution/0000-0099/0016.3Sum Closest/README.md +++ b/solution/0000-0099/0016.3Sum Closest/README.md @@ -1,5 +1,7 @@ # [16. 最接近的三数之和](https://leetcode-cn.com/problems/3sum-closest) +[English Version](/solution/0000-0099/0016.3Sum%20Closest/README_EN.md) + ## 题目描述

给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数，使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。

diff --git a/solution/0000-0099/0016.3Sum Closest/README_EN.md b/solution/0000-0099/0016.3Sum Closest/README_EN.md index 9474d7bcf0273..b89f1871b95ae 100644 --- a/solution/0000-0099/0016.3Sum Closest/README_EN.md +++ b/solution/0000-0099/0016.3Sum Closest/README_EN.md @@ -1,5 +1,7 @@ # [16. 3Sum Closest](https://leetcode.com/problems/3sum-closest) +[中文文档](/solution/0000-0099/0016.3Sum%20Closest/README.md) + ## Description

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md index 6caec74dac504..19b40d6f82329 100644 --- a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md +++ b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md @@ -1,5 +1,7 @@ # [17. 电话号码的字母组合](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number) +[English Version](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README_EN.md) + ## 题目描述

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。

diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md index c52e130959977..365ca9c9915fd 100644 --- a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md +++ b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md @@ -1,5 +1,7 @@ # [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) +[中文文档](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md) + ## Description

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

diff --git a/solution/0000-0099/0018.4Sum/README.md b/solution/0000-0099/0018.4Sum/README.md index 6f59cbaa17b5a..c399d858c1d33 100644 --- a/solution/0000-0099/0018.4Sum/README.md +++ b/solution/0000-0099/0018.4Sum/README.md @@ -1,5 +1,7 @@ # [18. 四数之和](https://leetcode-cn.com/problems/4sum) +[English Version](/solution/0000-0099/0018.4Sum/README_EN.md) + ## 题目描述

给定一个包含 n 个整数的数组 nums 和一个目标值 target，判断 nums 中是否存在四个元素 a，b，c 和 d ，使得 a + b + c + d 的值与 target 相等？找出所有满足条件且不重复的四元组。

diff --git a/solution/0000-0099/0018.4Sum/README_EN.md b/solution/0000-0099/0018.4Sum/README_EN.md index 3a0c7751e6584..1860ed1afc8bb 100644 --- a/solution/0000-0099/0018.4Sum/README_EN.md +++ b/solution/0000-0099/0018.4Sum/README_EN.md @@ -1,5 +1,7 @@ # [18. 4Sum](https://leetcode.com/problems/4sum) +[中文文档](/solution/0000-0099/0018.4Sum/README.md) + ## Description

Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.

diff --git a/solution/0000-0099/0019.Remove Nth Node From End of List/README.md b/solution/0000-0099/0019.Remove Nth Node From End of List/README.md index f59d82de9cd1a..137d0793eed70 100644 --- a/solution/0000-0099/0019.Remove Nth Node From End of List/README.md +++ b/solution/0000-0099/0019.Remove Nth Node From End of List/README.md @@ -1,5 +1,7 @@ # [19. 删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list) +[English Version](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README_EN.md) + ## 题目描述

给定一个链表，删除链表的倒数第 n 个节点，并且返回链表的头结点。

diff --git a/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md b/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md index ffbd92aff9750..3bfa09a67c17f 100644 --- a/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md +++ b/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md @@ -1,5 +1,7 @@ # [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) +[中文文档](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md) + ## Description

Given a linked list, remove the n-th node from the end of list and return its head.

diff --git a/solution/0000-0099/0020.Valid Parentheses/README.md b/solution/0000-0099/0020.Valid Parentheses/README.md index 5418da057af5f..63ed2d53957df 100644 --- a/solution/0000-0099/0020.Valid Parentheses/README.md +++ b/solution/0000-0099/0020.Valid Parentheses/README.md @@ -1,5 +1,7 @@ # [20. 有效的括号](https://leetcode-cn.com/problems/valid-parentheses) +[English Version](/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md) + ## 题目描述

给定一个只包括 '('，')'，'{'，'}'，'['，']' 的字符串，判断字符串是否有效。

diff --git a/solution/0000-0099/0020.Valid Parentheses/README_EN.md b/solution/0000-0099/0020.Valid Parentheses/README_EN.md index d1bd86b6e681e..dda56fa473a6c 100644 --- a/solution/0000-0099/0020.Valid Parentheses/README_EN.md +++ b/solution/0000-0099/0020.Valid Parentheses/README_EN.md @@ -1,5 +1,7 @@ # [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses) +[中文文档](/solution/0000-0099/0020.Valid%20Parentheses/README.md) + ## Description

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/README.md b/solution/0000-0099/0021.Merge Two Sorted Lists/README.md index 2015b1a8daf28..712b78f6d9648 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/README.md +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/README.md @@ -1,5 +1,7 @@ # [21. 合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists) +[English Version](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md) + ## 题目描述

将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md b/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md index f3cd18ad8d5e7..322145cd8e57e 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md @@ -1,5 +1,7 @@ # [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) +[中文文档](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md) + ## Description

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

diff --git a/solution/0000-0099/0022.Generate Parentheses/README.md b/solution/0000-0099/0022.Generate Parentheses/README.md index f38908ea9b95f..566acdf11f96d 100644 --- a/solution/0000-0099/0022.Generate Parentheses/README.md +++ b/solution/0000-0099/0022.Generate Parentheses/README.md @@ -1,5 +1,7 @@ # [22. 括号生成](https://leetcode-cn.com/problems/generate-parentheses) +[English Version](/solution/0000-0099/0022.Generate%20Parentheses/README_EN.md) + ## 题目描述

给出 n 代表生成括号的对数，请你写出一个函数，使其能够生成所有可能的并且有效的括号组合。

diff --git a/solution/0000-0099/0022.Generate Parentheses/README_EN.md b/solution/0000-0099/0022.Generate Parentheses/README_EN.md index 3a84faa7bf4f9..7948ecd7201be 100644 --- a/solution/0000-0099/0022.Generate Parentheses/README_EN.md +++ b/solution/0000-0099/0022.Generate Parentheses/README_EN.md @@ -1,5 +1,7 @@ # [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses) +[中文文档](/solution/0000-0099/0022.Generate%20Parentheses/README.md) + ## Description

diff --git a/solution/0000-0099/0023.Merge k Sorted Lists/README.md b/solution/0000-0099/0023.Merge k Sorted Lists/README.md index 13dd17c262e63..1094cbb2de152 100644 --- a/solution/0000-0099/0023.Merge k Sorted Lists/README.md +++ b/solution/0000-0099/0023.Merge k Sorted Lists/README.md @@ -1,5 +1,7 @@ # [23. 合并K个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists) +[English Version](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README_EN.md) + ## 题目描述

合并 k 个排序链表，返回合并后的排序链表。请分析和描述算法的复杂度。

diff --git a/solution/0000-0099/0023.Merge k Sorted Lists/README_EN.md b/solution/0000-0099/0023.Merge k Sorted Lists/README_EN.md index 54c696bc75995..72fb7318c0fd2 100644 --- a/solution/0000-0099/0023.Merge k Sorted Lists/README_EN.md +++ b/solution/0000-0099/0023.Merge k Sorted Lists/README_EN.md @@ -1,5 +1,7 @@ # [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) +[中文文档](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md) + ## Description

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

diff --git a/solution/0000-0099/0024.Swap Nodes in Pairs/README.md b/solution/0000-0099/0024.Swap Nodes in Pairs/README.md index 80f766915f808..71facf4262a32 100644 --- a/solution/0000-0099/0024.Swap Nodes in Pairs/README.md +++ b/solution/0000-0099/0024.Swap Nodes in Pairs/README.md @@ -1,5 +1,7 @@ # [24. 两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs) +[English Version](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README_EN.md) + ## 题目描述

给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。

diff --git a/solution/0000-0099/0024.Swap Nodes in Pairs/README_EN.md b/solution/0000-0099/0024.Swap Nodes in Pairs/README_EN.md index ca3d0f541399b..d52d51b2528e9 100644 --- a/solution/0000-0099/0024.Swap Nodes in Pairs/README_EN.md +++ b/solution/0000-0099/0024.Swap Nodes in Pairs/README_EN.md @@ -1,5 +1,7 @@ # [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) +[中文文档](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md) + ## Description

Given a linked list, swap every two adjacent nodes and return its head.

diff --git a/solution/0000-0099/0025.Reverse Nodes in k-Group/README.md b/solution/0000-0099/0025.Reverse Nodes in k-Group/README.md index 6ae99384523a4..ed214a9af07e4 100644 --- a/solution/0000-0099/0025.Reverse Nodes in k-Group/README.md +++ b/solution/0000-0099/0025.Reverse Nodes in k-Group/README.md @@ -1,5 +1,7 @@ # [25. K 个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group) +[English Version](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README_EN.md) + ## 题目描述

给你一个链表，每 k 个节点一组进行翻转，请你返回翻转后的链表。

diff --git a/solution/0000-0099/0025.Reverse Nodes in k-Group/README_EN.md b/solution/0000-0099/0025.Reverse Nodes in k-Group/README_EN.md index 887a11ab26c24..90d54bf622fb7 100644 --- a/solution/0000-0099/0025.Reverse Nodes in k-Group/README_EN.md +++ b/solution/0000-0099/0025.Reverse Nodes in k-Group/README_EN.md @@ -1,5 +1,7 @@ # [25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) +[中文文档](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md) + ## Description

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

diff --git a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md index e15bf81b7c49e..96052c625e537 100644 --- a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md +++ b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md @@ -1,5 +1,7 @@ # [26. 删除排序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array) +[English Version](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md) + ## 题目描述

给定一个排序数组，你需要在 原地 删除重复出现的元素，使得每个元素只出现一次，返回移除后数组的新长度。

diff --git a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md index 3c52e4f77e691..638e44384f5fd 100644 --- a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md +++ b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md @@ -1,5 +1,7 @@ # [26. Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) +[中文文档](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md) + ## Description

Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.

diff --git a/solution/0000-0099/0027.Remove Element/README.md b/solution/0000-0099/0027.Remove Element/README.md index edc26f71e4ad1..e3c044400ac68 100644 --- a/solution/0000-0099/0027.Remove Element/README.md +++ b/solution/0000-0099/0027.Remove Element/README.md @@ -1,5 +1,7 @@ # [27. 移除元素](https://leetcode-cn.com/problems/remove-element) +[English Version](/solution/0000-0099/0027.Remove%20Element/README_EN.md) + ## 题目描述

给你一个数组 nums 和一个值 val，你需要 原地 移除所有数值等于 val 的元素，并返回移除后数组的新长度。

diff --git a/solution/0000-0099/0027.Remove Element/README_EN.md b/solution/0000-0099/0027.Remove Element/README_EN.md index 21b736f7e8fc2..767530f246cd3 100644 --- a/solution/0000-0099/0027.Remove Element/README_EN.md +++ b/solution/0000-0099/0027.Remove Element/README_EN.md @@ -1,5 +1,7 @@ # [27. Remove Element](https://leetcode.com/problems/remove-element) +[中文文档](/solution/0000-0099/0027.Remove%20Element/README.md) + ## Description

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

diff --git a/solution/0000-0099/0028.Implement strStr()/README.md b/solution/0000-0099/0028.Implement strStr()/README.md index b7319828a0b2e..e3b5a09c1020e 100644 --- a/solution/0000-0099/0028.Implement strStr()/README.md +++ b/solution/0000-0099/0028.Implement strStr()/README.md @@ -1,5 +1,7 @@ # [28. 实现 strStr()](https://leetcode-cn.com/problems/implement-strstr) +[English Version](/solution/0000-0099/0028.Implement%20strStr()/README_EN.md) + ## 题目描述

实现 strStr() 函数。

diff --git a/solution/0000-0099/0028.Implement strStr()/README_EN.md b/solution/0000-0099/0028.Implement strStr()/README_EN.md index fb767d1bc34cc..d7c32e3e00626 100644 --- a/solution/0000-0099/0028.Implement strStr()/README_EN.md +++ b/solution/0000-0099/0028.Implement strStr()/README_EN.md @@ -1,5 +1,7 @@ # [28. Implement strStr()](https://leetcode.com/problems/implement-strstr) +[中文文档](/solution/0000-0099/0028.Implement%20strStr()/README.md) + ## Description

Implement strStr().

diff --git a/solution/0000-0099/0029.Divide Two Integers/README.md b/solution/0000-0099/0029.Divide Two Integers/README.md index bf7f3f863529b..3aec5adbe0599 100644 --- a/solution/0000-0099/0029.Divide Two Integers/README.md +++ b/solution/0000-0099/0029.Divide Two Integers/README.md @@ -1,5 +1,7 @@ # [29. 两数相除](https://leetcode-cn.com/problems/divide-two-integers) +[English Version](/solution/0000-0099/0029.Divide%20Two%20Integers/README_EN.md) + ## 题目描述

给定两个整数，被除数 dividend 和除数 divisor。将两数相除，要求不使用乘法、除法和 mod 运算符。

diff --git a/solution/0000-0099/0029.Divide Two Integers/README_EN.md b/solution/0000-0099/0029.Divide Two Integers/README_EN.md index c0302210a90a6..a806a328ab9d6 100644 --- a/solution/0000-0099/0029.Divide Two Integers/README_EN.md +++ b/solution/0000-0099/0029.Divide Two Integers/README_EN.md @@ -1,5 +1,7 @@ # [29. Divide Two Integers](https://leetcode.com/problems/divide-two-integers) +[中文文档](/solution/0000-0099/0029.Divide%20Two%20Integers/README.md) + ## Description

Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.

diff --git a/solution/0000-0099/0030.Substring with Concatenation of All Words/README.md b/solution/0000-0099/0030.Substring with Concatenation of All Words/README.md index d0c0c1e1f2130..304f4a3eff3ca 100644 --- a/solution/0000-0099/0030.Substring with Concatenation of All Words/README.md +++ b/solution/0000-0099/0030.Substring with Concatenation of All Words/README.md @@ -1,5 +1,7 @@ # [30. 串联所有单词的子串](https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words) +[English Version](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README_EN.md) + ## 题目描述

给定一个字符串 s 和一些长度相同的单词 words。找出 s 中恰好可以由 words 中所有单词串联形成的子串的起始位置。

diff --git a/solution/0000-0099/0030.Substring with Concatenation of All Words/README_EN.md b/solution/0000-0099/0030.Substring with Concatenation of All Words/README_EN.md index 5fdbe48490cea..1172d9f0ac0c2 100644 --- a/solution/0000-0099/0030.Substring with Concatenation of All Words/README_EN.md +++ b/solution/0000-0099/0030.Substring with Concatenation of All Words/README_EN.md @@ -1,5 +1,7 @@ # [30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) +[中文文档](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README.md) + ## Description

You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and without any intervening characters.

diff --git a/solution/0000-0099/0031.Next Permutation/README.md b/solution/0000-0099/0031.Next Permutation/README.md index d48011b17f274..c66b99afa2c7d 100644 --- a/solution/0000-0099/0031.Next Permutation/README.md +++ b/solution/0000-0099/0031.Next Permutation/README.md @@ -1,5 +1,7 @@ # [31. 下一个排列](https://leetcode-cn.com/problems/next-permutation) +[English Version](/solution/0000-0099/0031.Next%20Permutation/README_EN.md) + ## 题目描述

实现获取下一个排列的函数，算法需要将给定数字序列重新排列成字典序中下一个更大的排列。

diff --git a/solution/0000-0099/0031.Next Permutation/README_EN.md b/solution/0000-0099/0031.Next Permutation/README_EN.md index 50bfac6893501..8381cade5ecf9 100644 --- a/solution/0000-0099/0031.Next Permutation/README_EN.md +++ b/solution/0000-0099/0031.Next Permutation/README_EN.md @@ -1,5 +1,7 @@ # [31. Next Permutation](https://leetcode.com/problems/next-permutation) +[中文文档](/solution/0000-0099/0031.Next%20Permutation/README.md) + ## Description

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

diff --git a/solution/0000-0099/0032.Longest Valid Parentheses/README.md b/solution/0000-0099/0032.Longest Valid Parentheses/README.md index 7edc1ff92c252..00c203e45e961 100644 --- a/solution/0000-0099/0032.Longest Valid Parentheses/README.md +++ b/solution/0000-0099/0032.Longest Valid Parentheses/README.md @@ -1,5 +1,7 @@ # [32. 最长有效括号](https://leetcode-cn.com/problems/longest-valid-parentheses) +[English Version](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README_EN.md) + ## 题目描述

给定一个只包含 '(' 和 ')' 的字符串，找出最长的包含有效括号的子串的长度。

diff --git a/solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md b/solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md index a99dedad2275b..0ff90ff98bec8 100644 --- a/solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md +++ b/solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md @@ -1,5 +1,7 @@ # [32. Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) +[中文文档](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README.md) + ## Description

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.

diff --git a/solution/0000-0099/0033.Search in Rotated Sorted Array/README.md b/solution/0000-0099/0033.Search in Rotated Sorted Array/README.md index cace00e67aa0b..dfe56d7946626 100644 --- a/solution/0000-0099/0033.Search in Rotated Sorted Array/README.md +++ b/solution/0000-0099/0033.Search in Rotated Sorted Array/README.md @@ -1,5 +1,7 @@ # [33. 搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array) +[English Version](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README_EN.md) + ## 题目描述

假设按照升序排序的数组在预先未知的某个点上进行了旋转。

diff --git a/solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md b/solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md index a42cb093f1b63..2242c164c026c 100644 --- a/solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md +++ b/solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md @@ -1,5 +1,7 @@ # [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) +[中文文档](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README.md) + ## Description

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

diff --git a/solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md b/solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md index fc0532ea84b53..88b2744f457d5 100644 --- a/solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md +++ b/solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md @@ -1,5 +1,7 @@ # [34. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array) +[English Version](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README_EN.md) + ## 题目描述

给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。

diff --git a/solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README_EN.md b/solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README_EN.md index ad86198795611..f1b20977890d9 100644 --- a/solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README_EN.md +++ b/solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README_EN.md @@ -1,5 +1,7 @@ # [34. Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) +[中文文档](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md) + ## Description

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

diff --git a/solution/0000-0099/0035.Search Insert Position/README.md b/solution/0000-0099/0035.Search Insert Position/README.md index b61be75d9ea71..1ae86d8f2e162 100644 --- a/solution/0000-0099/0035.Search Insert Position/README.md +++ b/solution/0000-0099/0035.Search Insert Position/README.md @@ -1,5 +1,7 @@ # [35. 搜索插入位置](https://leetcode-cn.com/problems/search-insert-position) +[English Version](/solution/0000-0099/0035.Search%20Insert%20Position/README_EN.md) + ## 题目描述

给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。

diff --git a/solution/0000-0099/0035.Search Insert Position/README_EN.md b/solution/0000-0099/0035.Search Insert Position/README_EN.md index 02f1edd27e604..8d3786f7fa664 100644 --- a/solution/0000-0099/0035.Search Insert Position/README_EN.md +++ b/solution/0000-0099/0035.Search Insert Position/README_EN.md @@ -1,5 +1,7 @@ # [35. Search Insert Position](https://leetcode.com/problems/search-insert-position) +[中文文档](/solution/0000-0099/0035.Search%20Insert%20Position/README.md) + ## Description

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

diff --git a/solution/0000-0099/0036.Valid Sudoku/README.md b/solution/0000-0099/0036.Valid Sudoku/README.md index fe40ae8ce0c5e..6b4f19c849fcd 100644 --- a/solution/0000-0099/0036.Valid Sudoku/README.md +++ b/solution/0000-0099/0036.Valid Sudoku/README.md @@ -1,5 +1,7 @@ # [36. 有效的数独](https://leetcode-cn.com/problems/valid-sudoku) +[English Version](/solution/0000-0099/0036.Valid%20Sudoku/README_EN.md) + ## 题目描述

判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。

diff --git a/solution/0000-0099/0036.Valid Sudoku/README_EN.md b/solution/0000-0099/0036.Valid Sudoku/README_EN.md index cc466eab7af1f..fe61a40292a75 100644 --- a/solution/0000-0099/0036.Valid Sudoku/README_EN.md +++ b/solution/0000-0099/0036.Valid Sudoku/README_EN.md @@ -1,5 +1,7 @@ # [36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku) +[中文文档](/solution/0000-0099/0036.Valid%20Sudoku/README.md) + ## Description

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

diff --git a/solution/0000-0099/0037.Sudoku Solver/README.md b/solution/0000-0099/0037.Sudoku Solver/README.md index 9b75520dd608d..980e8751c8e92 100644 --- a/solution/0000-0099/0037.Sudoku Solver/README.md +++ b/solution/0000-0099/0037.Sudoku Solver/README.md @@ -1,5 +1,7 @@ # [37. 解数独](https://leetcode-cn.com/problems/sudoku-solver) +[English Version](/solution/0000-0099/0037.Sudoku%20Solver/README_EN.md) + ## 题目描述

编写一个程序，通过已填充的空格来解决数独问题。

diff --git a/solution/0000-0099/0037.Sudoku Solver/README_EN.md b/solution/0000-0099/0037.Sudoku Solver/README_EN.md index 012c789cef49d..4088a6d7bd70e 100644 --- a/solution/0000-0099/0037.Sudoku Solver/README_EN.md +++ b/solution/0000-0099/0037.Sudoku Solver/README_EN.md @@ -1,5 +1,7 @@ # [37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver) +[中文文档](/solution/0000-0099/0037.Sudoku%20Solver/README.md) + ## Description

Write a program to solve a Sudoku puzzle by filling the empty cells.

diff --git a/solution/0000-0099/0038.Count and Say/README.md b/solution/0000-0099/0038.Count and Say/README.md index f5ff28a076f8d..58129268458d7 100644 --- a/solution/0000-0099/0038.Count and Say/README.md +++ b/solution/0000-0099/0038.Count and Say/README.md @@ -1,5 +1,7 @@ # [38. 外观数列](https://leetcode-cn.com/problems/count-and-say) +[English Version](/solution/0000-0099/0038.Count%20and%20Say/README_EN.md) + ## 题目描述

「外观数列」是一个整数序列，从数字 1 开始，序列中的每一项都是对前一项的描述。前五项如下：

diff --git a/solution/0000-0099/0038.Count and Say/README_EN.md b/solution/0000-0099/0038.Count and Say/README_EN.md index 0882d759616fd..c0a84ccd753c2 100644 --- a/solution/0000-0099/0038.Count and Say/README_EN.md +++ b/solution/0000-0099/0038.Count and Say/README_EN.md @@ -1,5 +1,7 @@ # [38. Count and Say](https://leetcode.com/problems/count-and-say) +[中文文档](/solution/0000-0099/0038.Count%20and%20Say/README.md) + ## Description

The count-and-say sequence is the sequence of integers with the first five terms as following:

diff --git a/solution/0000-0099/0039.Combination Sum/README.md b/solution/0000-0099/0039.Combination Sum/README.md index b39705710333b..1444579abe360 100644 --- a/solution/0000-0099/0039.Combination Sum/README.md +++ b/solution/0000-0099/0039.Combination Sum/README.md @@ -1,5 +1,7 @@ # [39. 组合总和](https://leetcode-cn.com/problems/combination-sum) +[English Version](/solution/0000-0099/0039.Combination%20Sum/README_EN.md) + ## 题目描述

给定一个无重复元素的数组 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。

diff --git a/solution/0000-0099/0039.Combination Sum/README_EN.md b/solution/0000-0099/0039.Combination Sum/README_EN.md index 1cff8acdca4f0..544e68dc081f7 100644 --- a/solution/0000-0099/0039.Combination Sum/README_EN.md +++ b/solution/0000-0099/0039.Combination Sum/README_EN.md @@ -1,5 +1,7 @@ # [39. Combination Sum](https://leetcode.com/problems/combination-sum) +[中文文档](/solution/0000-0099/0039.Combination%20Sum/README.md) + ## Description

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

diff --git a/solution/0000-0099/0040.Combination Sum II/README.md b/solution/0000-0099/0040.Combination Sum II/README.md index ad2820332e03d..b6010b3eaed33 100644 --- a/solution/0000-0099/0040.Combination Sum II/README.md +++ b/solution/0000-0099/0040.Combination Sum II/README.md @@ -1,5 +1,7 @@ # [40. 组合总和 II](https://leetcode-cn.com/problems/combination-sum-ii) +[English Version](/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md) + ## 题目描述

给定一个数组 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。

diff --git a/solution/0000-0099/0040.Combination Sum II/README_EN.md b/solution/0000-0099/0040.Combination Sum II/README_EN.md index 3750fbe145d43..0c158cbe7be34 100644 --- a/solution/0000-0099/0040.Combination Sum II/README_EN.md +++ b/solution/0000-0099/0040.Combination Sum II/README_EN.md @@ -1,5 +1,7 @@ # [40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii) +[中文文档](/solution/0000-0099/0040.Combination%20Sum%20II/README.md) + ## Description

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

diff --git a/solution/0000-0099/0041.First Missing Positive/README.md b/solution/0000-0099/0041.First Missing Positive/README.md index 76402551c8ac8..227250188afcf 100644 --- a/solution/0000-0099/0041.First Missing Positive/README.md +++ b/solution/0000-0099/0041.First Missing Positive/README.md @@ -1,5 +1,7 @@ # [41. 缺失的第一个正数](https://leetcode-cn.com/problems/first-missing-positive) +[English Version](/solution/0000-0099/0041.First%20Missing%20Positive/README_EN.md) + ## 题目描述

给定一个未排序的整数数组，找出其中没有出现的最小的正整数。

diff --git a/solution/0000-0099/0041.First Missing Positive/README_EN.md b/solution/0000-0099/0041.First Missing Positive/README_EN.md index 07aad97b28672..84cc4d17b5359 100644 --- a/solution/0000-0099/0041.First Missing Positive/README_EN.md +++ b/solution/0000-0099/0041.First Missing Positive/README_EN.md @@ -1,5 +1,7 @@ # [41. First Missing Positive](https://leetcode.com/problems/first-missing-positive) +[中文文档](/solution/0000-0099/0041.First%20Missing%20Positive/README.md) + ## Description

Given an unsorted integer array, find the smallest missing positive integer.

diff --git a/solution/0000-0099/0042.Trapping Rain Water/README.md b/solution/0000-0099/0042.Trapping Rain Water/README.md index 4b90e33b90417..ff27ef94c185d 100644 --- a/solution/0000-0099/0042.Trapping Rain Water/README.md +++ b/solution/0000-0099/0042.Trapping Rain Water/README.md @@ -1,5 +1,7 @@ # [42. 接雨水](https://leetcode-cn.com/problems/trapping-rain-water) +[English Version](/solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md) + ## 题目描述

给定 n 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。

diff --git a/solution/0000-0099/0042.Trapping Rain Water/README_EN.md b/solution/0000-0099/0042.Trapping Rain Water/README_EN.md index 044634107499e..f726ee57145ce 100644 --- a/solution/0000-0099/0042.Trapping Rain Water/README_EN.md +++ b/solution/0000-0099/0042.Trapping Rain Water/README_EN.md @@ -1,5 +1,7 @@ # [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) +[中文文档](/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md) + ## Description

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

diff --git a/solution/0000-0099/0043.Multiply Strings/README.md b/solution/0000-0099/0043.Multiply Strings/README.md index 868907ffabdd0..8335a9204a20b 100644 --- a/solution/0000-0099/0043.Multiply Strings/README.md +++ b/solution/0000-0099/0043.Multiply Strings/README.md @@ -1,5 +1,7 @@ # [43. 字符串相乘](https://leetcode-cn.com/problems/multiply-strings) +[English Version](/solution/0000-0099/0043.Multiply%20Strings/README_EN.md) + ## 题目描述

给定两个以字符串形式表示的非负整数 num1 和 num2，返回 num1 和 num2 的乘积，它们的乘积也表示为字符串形式。

diff --git a/solution/0000-0099/0043.Multiply Strings/README_EN.md b/solution/0000-0099/0043.Multiply Strings/README_EN.md index bafc0c80b27f1..e8d76e0bb89d9 100644 --- a/solution/0000-0099/0043.Multiply Strings/README_EN.md +++ b/solution/0000-0099/0043.Multiply Strings/README_EN.md @@ -1,5 +1,7 @@ # [43. Multiply Strings](https://leetcode.com/problems/multiply-strings) +[中文文档](/solution/0000-0099/0043.Multiply%20Strings/README.md) + ## Description

Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.

diff --git a/solution/0000-0099/0044.Wildcard Matching/README.md b/solution/0000-0099/0044.Wildcard Matching/README.md index 8544db30b6eaf..862c23b5ea5e8 100644 --- a/solution/0000-0099/0044.Wildcard Matching/README.md +++ b/solution/0000-0099/0044.Wildcard Matching/README.md @@ -1,5 +1,7 @@ # [44. 通配符匹配](https://leetcode-cn.com/problems/wildcard-matching) +[English Version](/solution/0000-0099/0044.Wildcard%20Matching/README_EN.md) + ## 题目描述

给定一个字符串 (s) 和一个字符模式 (p) ，实现一个支持 '?' 和 '*' 的通配符匹配。

diff --git a/solution/0000-0099/0044.Wildcard Matching/README_EN.md b/solution/0000-0099/0044.Wildcard Matching/README_EN.md index 88ad700c3d96c..2112e311a5b55 100644 --- a/solution/0000-0099/0044.Wildcard Matching/README_EN.md +++ b/solution/0000-0099/0044.Wildcard Matching/README_EN.md @@ -1,5 +1,7 @@ # [44. Wildcard Matching](https://leetcode.com/problems/wildcard-matching) +[中文文档](/solution/0000-0099/0044.Wildcard%20Matching/README.md) + ## Description

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*'.

diff --git a/solution/0000-0099/0045.Jump Game II/README.md b/solution/0000-0099/0045.Jump Game II/README.md index bff78210a1cfa..127ded5416fba 100644 --- a/solution/0000-0099/0045.Jump Game II/README.md +++ b/solution/0000-0099/0045.Jump Game II/README.md @@ -1,5 +1,7 @@ # [45. 跳跃游戏 II](https://leetcode-cn.com/problems/jump-game-ii) +[English Version](/solution/0000-0099/0045.Jump%20Game%20II/README_EN.md) + ## 题目描述

给定一个非负整数数组，你最初位于数组的第一个位置。

diff --git a/solution/0000-0099/0045.Jump Game II/README_EN.md b/solution/0000-0099/0045.Jump Game II/README_EN.md index 517f99571ed38..1933cf0a72b26 100644 --- a/solution/0000-0099/0045.Jump Game II/README_EN.md +++ b/solution/0000-0099/0045.Jump Game II/README_EN.md @@ -1,5 +1,7 @@ # [45. Jump Game II](https://leetcode.com/problems/jump-game-ii) +[中文文档](/solution/0000-0099/0045.Jump%20Game%20II/README.md) + ## Description

Given an array of non-negative integers, you are initially positioned at the first index of the array.

diff --git a/solution/0000-0099/0046.Permutations/README.md b/solution/0000-0099/0046.Permutations/README.md index c586a7e583956..3b5b5c95aaa1b 100644 --- a/solution/0000-0099/0046.Permutations/README.md +++ b/solution/0000-0099/0046.Permutations/README.md @@ -1,5 +1,7 @@ # [46. 全排列](https://leetcode-cn.com/problems/permutations) +[English Version](/solution/0000-0099/0046.Permutations/README_EN.md) + ## 题目描述

给定一个没有重复数字的序列，返回其所有可能的全排列。

diff --git a/solution/0000-0099/0046.Permutations/README_EN.md b/solution/0000-0099/0046.Permutations/README_EN.md index cdb8cb28f3fce..b84e6350e6baa 100644 --- a/solution/0000-0099/0046.Permutations/README_EN.md +++ b/solution/0000-0099/0046.Permutations/README_EN.md @@ -1,5 +1,7 @@ # [46. Permutations](https://leetcode.com/problems/permutations) +[中文文档](/solution/0000-0099/0046.Permutations/README.md) + ## Description

Given a collection of distinct integers, return all possible permutations.

diff --git a/solution/0000-0099/0047.Permutations II/README.md b/solution/0000-0099/0047.Permutations II/README.md index 7935057e1ff9c..283d6752ca984 100644 --- a/solution/0000-0099/0047.Permutations II/README.md +++ b/solution/0000-0099/0047.Permutations II/README.md @@ -1,5 +1,7 @@ # [47. 全排列 II](https://leetcode-cn.com/problems/permutations-ii) +[English Version](/solution/0000-0099/0047.Permutations%20II/README_EN.md) + ## 题目描述

给定一个可包含重复数字的序列，返回所有不重复的全排列。

diff --git a/solution/0000-0099/0047.Permutations II/README_EN.md b/solution/0000-0099/0047.Permutations II/README_EN.md index 6c7f24a1df947..da96d7b4f87f9 100644 --- a/solution/0000-0099/0047.Permutations II/README_EN.md +++ b/solution/0000-0099/0047.Permutations II/README_EN.md @@ -1,5 +1,7 @@ # [47. Permutations II](https://leetcode.com/problems/permutations-ii) +[中文文档](/solution/0000-0099/0047.Permutations%20II/README.md) + ## Description

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

diff --git a/solution/0000-0099/0048.Rotate Image/README.md b/solution/0000-0099/0048.Rotate Image/README.md index 78c1c6e6c6947..36e29256a677d 100644 --- a/solution/0000-0099/0048.Rotate Image/README.md +++ b/solution/0000-0099/0048.Rotate Image/README.md @@ -1,5 +1,7 @@ # [48. 旋转图像](https://leetcode-cn.com/problems/rotate-image) +[English Version](/solution/0000-0099/0048.Rotate%20Image/README_EN.md) + ## 题目描述

给定一个 n × n 的二维矩阵表示一个图像。

diff --git a/solution/0000-0099/0048.Rotate Image/README_EN.md b/solution/0000-0099/0048.Rotate Image/README_EN.md index 7317328afba52..6fe51db03f335 100644 --- a/solution/0000-0099/0048.Rotate Image/README_EN.md +++ b/solution/0000-0099/0048.Rotate Image/README_EN.md @@ -1,5 +1,7 @@ # [48. Rotate Image](https://leetcode.com/problems/rotate-image) +[中文文档](/solution/0000-0099/0048.Rotate%20Image/README.md) + ## Description

You are given an n x n 2D matrix representing an image.

diff --git a/solution/0000-0099/0049.Group Anagrams/README.md b/solution/0000-0099/0049.Group Anagrams/README.md index d560e81b8ca30..723543ab86e57 100644 --- a/solution/0000-0099/0049.Group Anagrams/README.md +++ b/solution/0000-0099/0049.Group Anagrams/README.md @@ -1,5 +1,7 @@ # [49. 字母异位词分组](https://leetcode-cn.com/problems/group-anagrams) +[English Version](/solution/0000-0099/0049.Group%20Anagrams/README_EN.md) + ## 题目描述

给定一个字符串数组，将字母异位词组合在一起。字母异位词指字母相同，但排列不同的字符串。

diff --git a/solution/0000-0099/0049.Group Anagrams/README_EN.md b/solution/0000-0099/0049.Group Anagrams/README_EN.md index 23b45237981ca..c2334b115af1f 100644 --- a/solution/0000-0099/0049.Group Anagrams/README_EN.md +++ b/solution/0000-0099/0049.Group Anagrams/README_EN.md @@ -1,5 +1,7 @@ # [49. Group Anagrams](https://leetcode.com/problems/group-anagrams) +[中文文档](/solution/0000-0099/0049.Group%20Anagrams/README.md) + ## Description

Given an array of strings, group anagrams together.

diff --git a/solution/0000-0099/0050.Pow(x, n)/README.md b/solution/0000-0099/0050.Pow(x, n)/README.md index 2b669186c4dd0..319058ca56745 100644 --- a/solution/0000-0099/0050.Pow(x, n)/README.md +++ b/solution/0000-0099/0050.Pow(x, n)/README.md @@ -1,5 +1,7 @@ # [50. Pow(x, n)](https://leetcode-cn.com/problems/powx-n) +[English Version](/solution/0000-0099/0050.Pow(x,%20n)/README_EN.md) + ## 题目描述

实现 pow(x, n) ，即计算 x 的 n 次幂函数。

diff --git a/solution/0000-0099/0050.Pow(x, n)/README_EN.md b/solution/0000-0099/0050.Pow(x, n)/README_EN.md index b44f4d11c05fb..5e4afb3a7cb2e 100644 --- a/solution/0000-0099/0050.Pow(x, n)/README_EN.md +++ b/solution/0000-0099/0050.Pow(x, n)/README_EN.md @@ -1,5 +1,7 @@ # [50. Pow(x, n)](https://leetcode.com/problems/powx-n) +[中文文档](/solution/0000-0099/0050.Pow(x,%20n)/README.md) + ## Description

Implement pow(x, n), which calculates x raised to the power n (xn).

diff --git a/solution/0000-0099/0051.N-Queens/README.md b/solution/0000-0099/0051.N-Queens/README.md index 4cce63aa8a67a..61a3be98fe4f3 100644 --- a/solution/0000-0099/0051.N-Queens/README.md +++ b/solution/0000-0099/0051.N-Queens/README.md @@ -1,5 +1,7 @@ # [51. N皇后](https://leetcode-cn.com/problems/n-queens) +[English Version](/solution/0000-0099/0051.N-Queens/README_EN.md) + ## 题目描述

n 皇后问题研究的是如何将 n 个皇后放置在 n×n 的棋盘上，并且使皇后彼此之间不能相互攻击。

diff --git a/solution/0000-0099/0051.N-Queens/README_EN.md b/solution/0000-0099/0051.N-Queens/README_EN.md index bad04bf99f8cc..2f558c20b0d0b 100644 --- a/solution/0000-0099/0051.N-Queens/README_EN.md +++ b/solution/0000-0099/0051.N-Queens/README_EN.md @@ -1,5 +1,7 @@ # [51. N-Queens](https://leetcode.com/problems/n-queens) +[中文文档](/solution/0000-0099/0051.N-Queens/README.md) + ## Description

The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.

diff --git a/solution/0000-0099/0052.N-Queens II/README.md b/solution/0000-0099/0052.N-Queens II/README.md index 5f15bf6672602..4477769a05e03 100644 --- a/solution/0000-0099/0052.N-Queens II/README.md +++ b/solution/0000-0099/0052.N-Queens II/README.md @@ -1,5 +1,7 @@ # [52. N皇后 II](https://leetcode-cn.com/problems/n-queens-ii) +[English Version](/solution/0000-0099/0052.N-Queens%20II/README_EN.md) + ## 题目描述

n 皇后问题研究的是如何将 n 个皇后放置在 n×n 的棋盘上，并且使皇后彼此之间不能相互攻击。

diff --git a/solution/0000-0099/0052.N-Queens II/README_EN.md b/solution/0000-0099/0052.N-Queens II/README_EN.md index d05baab44ab09..02a76b279193f 100644 --- a/solution/0000-0099/0052.N-Queens II/README_EN.md +++ b/solution/0000-0099/0052.N-Queens II/README_EN.md @@ -1,5 +1,7 @@ # [52. N-Queens II](https://leetcode.com/problems/n-queens-ii) +[中文文档](/solution/0000-0099/0052.N-Queens%20II/README.md) + ## Description

The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.

diff --git a/solution/0000-0099/0053.Maximum Subarray/README.md b/solution/0000-0099/0053.Maximum Subarray/README.md index 1b282dd2e4aa3..e9f9f33c1b5c5 100644 --- a/solution/0000-0099/0053.Maximum Subarray/README.md +++ b/solution/0000-0099/0053.Maximum Subarray/README.md @@ -1,5 +1,7 @@ # [53. 最大子序和](https://leetcode-cn.com/problems/maximum-subarray) +[English Version](/solution/0000-0099/0053.Maximum%20Subarray/README_EN.md) + ## 题目描述

给定一个整数数组 nums ，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。

diff --git a/solution/0000-0099/0053.Maximum Subarray/README_EN.md b/solution/0000-0099/0053.Maximum Subarray/README_EN.md index b03d7ffc72442..e89b3075e3c63 100644 --- a/solution/0000-0099/0053.Maximum Subarray/README_EN.md +++ b/solution/0000-0099/0053.Maximum Subarray/README_EN.md @@ -1,5 +1,7 @@ # [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray) +[中文文档](/solution/0000-0099/0053.Maximum%20Subarray/README.md) + ## Description

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

diff --git a/solution/0000-0099/0054.Spiral Matrix/README.md b/solution/0000-0099/0054.Spiral Matrix/README.md index 200d574801eea..d419a3fe61ba3 100644 --- a/solution/0000-0099/0054.Spiral Matrix/README.md +++ b/solution/0000-0099/0054.Spiral Matrix/README.md @@ -1,5 +1,7 @@ # [54. 螺旋矩阵](https://leetcode-cn.com/problems/spiral-matrix) +[English Version](/solution/0000-0099/0054.Spiral%20Matrix/README_EN.md) + ## 题目描述

给定一个包含 m x n 个元素的矩阵（m 行, n 列），请按照顺时针螺旋顺序，返回矩阵中的所有元素。

diff --git a/solution/0000-0099/0054.Spiral Matrix/README_EN.md b/solution/0000-0099/0054.Spiral Matrix/README_EN.md index 7b7aa13af9a61..2cc73cc951287 100644 --- a/solution/0000-0099/0054.Spiral Matrix/README_EN.md +++ b/solution/0000-0099/0054.Spiral Matrix/README_EN.md @@ -1,5 +1,7 @@ # [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix) +[中文文档](/solution/0000-0099/0054.Spiral%20Matrix/README.md) + ## Description

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

diff --git a/solution/0000-0099/0055.Jump Game/README.md b/solution/0000-0099/0055.Jump Game/README.md index 4e2fe2757620f..e7ce7b2ece159 100644 --- a/solution/0000-0099/0055.Jump Game/README.md +++ b/solution/0000-0099/0055.Jump Game/README.md @@ -1,5 +1,7 @@ # [55. 跳跃游戏](https://leetcode-cn.com/problems/jump-game) +[English Version](/solution/0000-0099/0055.Jump%20Game/README_EN.md) + ## 题目描述

给定一个非负整数数组，你最初位于数组的第一个位置。

diff --git a/solution/0000-0099/0055.Jump Game/README_EN.md b/solution/0000-0099/0055.Jump Game/README_EN.md index 4e77197f6039c..b99e54a70e568 100644 --- a/solution/0000-0099/0055.Jump Game/README_EN.md +++ b/solution/0000-0099/0055.Jump Game/README_EN.md @@ -1,5 +1,7 @@ # [55. Jump Game](https://leetcode.com/problems/jump-game) +[中文文档](/solution/0000-0099/0055.Jump%20Game/README.md) + ## Description

Given an array of non-negative integers, you are initially positioned at the first index of the array.

diff --git a/solution/0000-0099/0056.Merge Intervals/README.md b/solution/0000-0099/0056.Merge Intervals/README.md index c49ccaa30b61b..0f0b4a470728c 100644 --- a/solution/0000-0099/0056.Merge Intervals/README.md +++ b/solution/0000-0099/0056.Merge Intervals/README.md @@ -1,5 +1,7 @@ # [56. 合并区间](https://leetcode-cn.com/problems/merge-intervals) +[English Version](/solution/0000-0099/0056.Merge%20Intervals/README_EN.md) + ## 题目描述

给出一个区间的集合，请合并所有重叠的区间。

diff --git a/solution/0000-0099/0056.Merge Intervals/README_EN.md b/solution/0000-0099/0056.Merge Intervals/README_EN.md index 971fcfdc3cb0f..1ed2bd586903f 100644 --- a/solution/0000-0099/0056.Merge Intervals/README_EN.md +++ b/solution/0000-0099/0056.Merge Intervals/README_EN.md @@ -1,5 +1,7 @@ # [56. Merge Intervals](https://leetcode.com/problems/merge-intervals) +[中文文档](/solution/0000-0099/0056.Merge%20Intervals/README.md) + ## Description

Given a collection of intervals, merge all overlapping intervals.

diff --git a/solution/0000-0099/0057.Insert Interval/README.md b/solution/0000-0099/0057.Insert Interval/README.md index efcd04d4df4b0..12434a145fd6e 100644 --- a/solution/0000-0099/0057.Insert Interval/README.md +++ b/solution/0000-0099/0057.Insert Interval/README.md @@ -1,5 +1,7 @@ # [57. 插入区间](https://leetcode-cn.com/problems/insert-interval) +[English Version](/solution/0000-0099/0057.Insert%20Interval/README_EN.md) + ## 题目描述

给出一个无重叠的 ，按照区间起始端点排序的区间列表。

diff --git a/solution/0000-0099/0057.Insert Interval/README_EN.md b/solution/0000-0099/0057.Insert Interval/README_EN.md index 8511a09dc5f7a..1cf7726c77fb5 100644 --- a/solution/0000-0099/0057.Insert Interval/README_EN.md +++ b/solution/0000-0099/0057.Insert Interval/README_EN.md @@ -1,5 +1,7 @@ # [57. Insert Interval](https://leetcode.com/problems/insert-interval) +[中文文档](/solution/0000-0099/0057.Insert%20Interval/README.md) + ## Description

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

diff --git a/solution/0000-0099/0058.Length of Last Word/README.md b/solution/0000-0099/0058.Length of Last Word/README.md index f661b654549e2..4146e8271670f 100644 --- a/solution/0000-0099/0058.Length of Last Word/README.md +++ b/solution/0000-0099/0058.Length of Last Word/README.md @@ -1,5 +1,7 @@ # [58. 最后一个单词的长度](https://leetcode-cn.com/problems/length-of-last-word) +[English Version](/solution/0000-0099/0058.Length%20of%20Last%20Word/README_EN.md) + ## 题目描述

给定一个仅包含大小写字母和空格 ' ' 的字符串 s，返回其最后一个单词的长度。如果字符串从左向右滚动显示，那么最后一个单词就是最后出现的单词。

diff --git a/solution/0000-0099/0058.Length of Last Word/README_EN.md b/solution/0000-0099/0058.Length of Last Word/README_EN.md index dc581b668d331..fe9a9d1c35b4c 100644 --- a/solution/0000-0099/0058.Length of Last Word/README_EN.md +++ b/solution/0000-0099/0058.Length of Last Word/README_EN.md @@ -1,5 +1,7 @@ # [58. Length of Last Word](https://leetcode.com/problems/length-of-last-word) +[中文文档](/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md) + ## Description

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word (last word means the last appearing word if we loop from left to right) in the string.

diff --git a/solution/0000-0099/0059.Spiral Matrix II/README.md b/solution/0000-0099/0059.Spiral Matrix II/README.md index 48e48e492da1d..c04d4f1e9ea9d 100644 --- a/solution/0000-0099/0059.Spiral Matrix II/README.md +++ b/solution/0000-0099/0059.Spiral Matrix II/README.md @@ -1,5 +1,7 @@ # [59. 螺旋矩阵 II](https://leetcode-cn.com/problems/spiral-matrix-ii) +[English Version](/solution/0000-0099/0059.Spiral%20Matrix%20II/README_EN.md) + ## 题目描述

给定一个正整数 n，生成一个包含 1 到 n2 所有元素，且元素按顺时针顺序螺旋排列的正方形矩阵。

diff --git a/solution/0000-0099/0059.Spiral Matrix II/README_EN.md b/solution/0000-0099/0059.Spiral Matrix II/README_EN.md index 3a96ca62ec1b6..ac1d845a0448f 100644 --- a/solution/0000-0099/0059.Spiral Matrix II/README_EN.md +++ b/solution/0000-0099/0059.Spiral Matrix II/README_EN.md @@ -1,5 +1,7 @@ # [59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) +[中文文档](/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md) + ## Description

Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

diff --git a/solution/0000-0099/0060.Permutation Sequence/README.md b/solution/0000-0099/0060.Permutation Sequence/README.md index 60c062aaeff9c..b8b14e5709449 100644 --- a/solution/0000-0099/0060.Permutation Sequence/README.md +++ b/solution/0000-0099/0060.Permutation Sequence/README.md @@ -1,5 +1,7 @@ # [60. 第k个排列](https://leetcode-cn.com/problems/permutation-sequence) +[English Version](/solution/0000-0099/0060.Permutation%20Sequence/README_EN.md) + ## 题目描述

给出集合 [1,2,3,…,n]，其所有元素共有 n! 种排列。

diff --git a/solution/0000-0099/0060.Permutation Sequence/README_EN.md b/solution/0000-0099/0060.Permutation Sequence/README_EN.md index c2ac8e6a76a67..b66fbc1e2eb70 100644 --- a/solution/0000-0099/0060.Permutation Sequence/README_EN.md +++ b/solution/0000-0099/0060.Permutation Sequence/README_EN.md @@ -1,5 +1,7 @@ # [60. Permutation Sequence](https://leetcode.com/problems/permutation-sequence) +[中文文档](/solution/0000-0099/0060.Permutation%20Sequence/README.md) + ## Description

The set [1,2,3,...,n] contains a total of n! unique permutations.

diff --git a/solution/0000-0099/0061.Rotate List/README.md b/solution/0000-0099/0061.Rotate List/README.md index 784044cf3ac15..fbce1fcd8a4eb 100644 --- a/solution/0000-0099/0061.Rotate List/README.md +++ b/solution/0000-0099/0061.Rotate List/README.md @@ -1,5 +1,7 @@ # [61. 旋转链表](https://leetcode-cn.com/problems/rotate-list) +[English Version](/solution/0000-0099/0061.Rotate%20List/README_EN.md) + ## 题目描述

给定一个链表，旋转链表，将链表每个节点向右移动 k 个位置，其中 k 是非负数。

diff --git a/solution/0000-0099/0061.Rotate List/README_EN.md b/solution/0000-0099/0061.Rotate List/README_EN.md index 91f4ed28963bf..5a866849a7979 100644 --- a/solution/0000-0099/0061.Rotate List/README_EN.md +++ b/solution/0000-0099/0061.Rotate List/README_EN.md @@ -1,5 +1,7 @@ # [61. Rotate List](https://leetcode.com/problems/rotate-list) +[中文文档](/solution/0000-0099/0061.Rotate%20List/README.md) + ## Description

Given a linked list, rotate the list to the right by k places, where k is non-negative.

diff --git a/solution/0000-0099/0062.Unique Paths/README.md b/solution/0000-0099/0062.Unique Paths/README.md index ad2044143be9c..81d5f9dbe04e5 100644 --- a/solution/0000-0099/0062.Unique Paths/README.md +++ b/solution/0000-0099/0062.Unique Paths/README.md @@ -1,5 +1,7 @@ # [62. 不同路径](https://leetcode-cn.com/problems/unique-paths) +[English Version](/solution/0000-0099/0062.Unique%20Paths/README_EN.md) + ## 题目描述

一个机器人位于一个 m x n 网格的左上角 （起始点在下图中标记为“Start” ）。

diff --git a/solution/0000-0099/0062.Unique Paths/README_EN.md b/solution/0000-0099/0062.Unique Paths/README_EN.md index 9d9e598d8fcac..35ffdc0d33e85 100644 --- a/solution/0000-0099/0062.Unique Paths/README_EN.md +++ b/solution/0000-0099/0062.Unique Paths/README_EN.md @@ -1,5 +1,7 @@ # [62. Unique Paths](https://leetcode.com/problems/unique-paths) +[中文文档](/solution/0000-0099/0062.Unique%20Paths/README.md) + ## Description

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

diff --git a/solution/0000-0099/0063.Unique Paths II/README.md b/solution/0000-0099/0063.Unique Paths II/README.md index 9c55f4e94f0c6..d5085d298b221 100644 --- a/solution/0000-0099/0063.Unique Paths II/README.md +++ b/solution/0000-0099/0063.Unique Paths II/README.md @@ -1,5 +1,7 @@ # [63. 不同路径 II](https://leetcode-cn.com/problems/unique-paths-ii) +[English Version](/solution/0000-0099/0063.Unique%20Paths%20II/README_EN.md) + ## 题目描述

一个机器人位于一个 m x n 网格的左上角 （起始点在下图中标记为“Start” ）。

diff --git a/solution/0000-0099/0063.Unique Paths II/README_EN.md b/solution/0000-0099/0063.Unique Paths II/README_EN.md index c7886b196c90d..570e0404b2e50 100644 --- a/solution/0000-0099/0063.Unique Paths II/README_EN.md +++ b/solution/0000-0099/0063.Unique Paths II/README_EN.md @@ -1,5 +1,7 @@ # [63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii) +[中文文档](/solution/0000-0099/0063.Unique%20Paths%20II/README.md) + ## Description

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

diff --git a/solution/0000-0099/0064.Minimum Path Sum/README.md b/solution/0000-0099/0064.Minimum Path Sum/README.md index c81b65b03ab13..d82c2863642e6 100644 --- a/solution/0000-0099/0064.Minimum Path Sum/README.md +++ b/solution/0000-0099/0064.Minimum Path Sum/README.md @@ -1,5 +1,7 @@ # [64. 最小路径和](https://leetcode-cn.com/problems/minimum-path-sum) +[English Version](/solution/0000-0099/0064.Minimum%20Path%20Sum/README_EN.md) + ## 题目描述

给定一个包含非负整数的 m x n 网格，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。

diff --git a/solution/0000-0099/0064.Minimum Path Sum/README_EN.md b/solution/0000-0099/0064.Minimum Path Sum/README_EN.md index 14f8c750dcb4f..b460ff518ba3c 100644 --- a/solution/0000-0099/0064.Minimum Path Sum/README_EN.md +++ b/solution/0000-0099/0064.Minimum Path Sum/README_EN.md @@ -1,5 +1,7 @@ # [64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) +[中文文档](/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md) + ## Description

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

diff --git a/solution/0000-0099/0065.Valid Number/README.md b/solution/0000-0099/0065.Valid Number/README.md index 15d88fb0f99f4..e26f8a48722df 100644 --- a/solution/0000-0099/0065.Valid Number/README.md +++ b/solution/0000-0099/0065.Valid Number/README.md @@ -1,5 +1,7 @@ # [65. 有效数字](https://leetcode-cn.com/problems/valid-number) +[English Version](/solution/0000-0099/0065.Valid%20Number/README_EN.md) + ## 题目描述

验证给定的字符串是否可以解释为十进制数字。

diff --git a/solution/0000-0099/0065.Valid Number/README_EN.md b/solution/0000-0099/0065.Valid Number/README_EN.md index d4ea6753639ca..c8bb604a3da68 100644 --- a/solution/0000-0099/0065.Valid Number/README_EN.md +++ b/solution/0000-0099/0065.Valid Number/README_EN.md @@ -1,5 +1,7 @@ # [65. Valid Number](https://leetcode.com/problems/valid-number) +[中文文档](/solution/0000-0099/0065.Valid%20Number/README.md) + ## Description

Validate if a given string can be interpreted as a decimal number.

diff --git a/solution/0000-0099/0066.Plus One/README.md b/solution/0000-0099/0066.Plus One/README.md index 38c9f16b72ed0..fd2d027cc8f17 100644 --- a/solution/0000-0099/0066.Plus One/README.md +++ b/solution/0000-0099/0066.Plus One/README.md @@ -1,5 +1,7 @@ # [66. 加一](https://leetcode-cn.com/problems/plus-one) +[English Version](/solution/0000-0099/0066.Plus%20One/README_EN.md) + ## 题目描述

给定一个由整数组成的非空数组所表示的非负整数，在该数的基础上加一。

diff --git a/solution/0000-0099/0066.Plus One/README_EN.md b/solution/0000-0099/0066.Plus One/README_EN.md index 9f345a4b87ecf..c9680af5cca03 100644 --- a/solution/0000-0099/0066.Plus One/README_EN.md +++ b/solution/0000-0099/0066.Plus One/README_EN.md @@ -1,5 +1,7 @@ # [66. Plus One](https://leetcode.com/problems/plus-one) +[中文文档](/solution/0000-0099/0066.Plus%20One/README.md) + ## Description

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

diff --git a/solution/0000-0099/0067.Add Binary/README.md b/solution/0000-0099/0067.Add Binary/README.md index 4eb8c77738c4b..acd15bbb581ad 100644 --- a/solution/0000-0099/0067.Add Binary/README.md +++ b/solution/0000-0099/0067.Add Binary/README.md @@ -1,5 +1,7 @@ # [67. 二进制求和](https://leetcode-cn.com/problems/add-binary) +[English Version](/solution/0000-0099/0067.Add%20Binary/README_EN.md) + ## 题目描述

给定两个二进制字符串，返回他们的和（用二进制表示）。

diff --git a/solution/0000-0099/0067.Add Binary/README_EN.md b/solution/0000-0099/0067.Add Binary/README_EN.md index cd3dccb267df9..eb46de91f178d 100644 --- a/solution/0000-0099/0067.Add Binary/README_EN.md +++ b/solution/0000-0099/0067.Add Binary/README_EN.md @@ -1,5 +1,7 @@ # [67. Add Binary](https://leetcode.com/problems/add-binary) +[中文文档](/solution/0000-0099/0067.Add%20Binary/README.md) + ## Description

Given two binary strings, return their sum (also a binary string).

diff --git a/solution/0000-0099/0068.Text Justification/README.md b/solution/0000-0099/0068.Text Justification/README.md index 9dd27b22c2b13..e4ff717096cc1 100644 --- a/solution/0000-0099/0068.Text Justification/README.md +++ b/solution/0000-0099/0068.Text Justification/README.md @@ -1,5 +1,7 @@ # [68. 文本左右对齐](https://leetcode-cn.com/problems/text-justification) +[English Version](/solution/0000-0099/0068.Text%20Justification/README_EN.md) + ## 题目描述

给定一个单词数组和一个长度 maxWidth，重新排版单词，使其成为每行恰好有 maxWidth 个字符，且左右两端对齐的文本。

diff --git a/solution/0000-0099/0068.Text Justification/README_EN.md b/solution/0000-0099/0068.Text Justification/README_EN.md index a324af5a500b3..58169dad6c7ce 100644 --- a/solution/0000-0099/0068.Text Justification/README_EN.md +++ b/solution/0000-0099/0068.Text Justification/README_EN.md @@ -1,5 +1,7 @@ # [68. Text Justification](https://leetcode.com/problems/text-justification) +[中文文档](/solution/0000-0099/0068.Text%20Justification/README.md) + ## Description

Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified.

diff --git a/solution/0000-0099/0069.Sqrt(x)/README.md b/solution/0000-0099/0069.Sqrt(x)/README.md index b45d44c01a6d8..ea68cc1159f92 100644 --- a/solution/0000-0099/0069.Sqrt(x)/README.md +++ b/solution/0000-0099/0069.Sqrt(x)/README.md @@ -1,5 +1,7 @@ # [69. x 的平方根](https://leetcode-cn.com/problems/sqrtx) +[English Version](/solution/0000-0099/0069.Sqrt(x)/README_EN.md) + ## 题目描述

实现 int sqrt(int x) 函数。

diff --git a/solution/0000-0099/0069.Sqrt(x)/README_EN.md b/solution/0000-0099/0069.Sqrt(x)/README_EN.md index 3c1fb70bc129e..c4f519b69c9ae 100644 --- a/solution/0000-0099/0069.Sqrt(x)/README_EN.md +++ b/solution/0000-0099/0069.Sqrt(x)/README_EN.md @@ -1,5 +1,7 @@ # [69. Sqrt(x)](https://leetcode.com/problems/sqrtx) +[中文文档](/solution/0000-0099/0069.Sqrt(x)/README.md) + ## Description

Implement int sqrt(int x).

diff --git a/solution/0000-0099/0070.Climbing Stairs/README.md b/solution/0000-0099/0070.Climbing Stairs/README.md index bfdc41c2666d1..168f553040a07 100644 --- a/solution/0000-0099/0070.Climbing Stairs/README.md +++ b/solution/0000-0099/0070.Climbing Stairs/README.md @@ -1,5 +1,7 @@ # [70. 爬楼梯](https://leetcode-cn.com/problems/climbing-stairs) +[English Version](/solution/0000-0099/0070.Climbing%20Stairs/README_EN.md) + ## 题目描述

假设你正在爬楼梯。需要 n 阶你才能到达楼顶。

diff --git a/solution/0000-0099/0070.Climbing Stairs/README_EN.md b/solution/0000-0099/0070.Climbing Stairs/README_EN.md index 101b937b9f354..27d6086e33808 100644 --- a/solution/0000-0099/0070.Climbing Stairs/README_EN.md +++ b/solution/0000-0099/0070.Climbing Stairs/README_EN.md @@ -1,5 +1,7 @@ # [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs) +[中文文档](/solution/0000-0099/0070.Climbing%20Stairs/README.md) + ## Description

You are climbing a stair case. It takes n steps to reach to the top.

diff --git a/solution/0000-0099/0071.Simplify Path/README.md b/solution/0000-0099/0071.Simplify Path/README.md index a54e4aa4f2427..9176087118238 100644 --- a/solution/0000-0099/0071.Simplify Path/README.md +++ b/solution/0000-0099/0071.Simplify Path/README.md @@ -1,5 +1,7 @@ # [71. 简化路径](https://leetcode-cn.com/problems/simplify-path) +[English Version](/solution/0000-0099/0071.Simplify%20Path/README_EN.md) + ## 题目描述

以 Unix 风格给出一个文件的绝对路径，你需要简化它。或者换句话说，将其转换为规范路径。

diff --git a/solution/0000-0099/0071.Simplify Path/README_EN.md b/solution/0000-0099/0071.Simplify Path/README_EN.md index 67a05cd74ea82..00db64d63005d 100644 --- a/solution/0000-0099/0071.Simplify Path/README_EN.md +++ b/solution/0000-0099/0071.Simplify Path/README_EN.md @@ -1,5 +1,7 @@ # [71. Simplify Path](https://leetcode.com/problems/simplify-path) +[中文文档](/solution/0000-0099/0071.Simplify%20Path/README.md) + ## Description

Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.

diff --git a/solution/0000-0099/0072.Edit Distance/README.md b/solution/0000-0099/0072.Edit Distance/README.md index e331b23b990b3..c28fcbb1c4ddd 100644 --- a/solution/0000-0099/0072.Edit Distance/README.md +++ b/solution/0000-0099/0072.Edit Distance/README.md @@ -1,5 +1,7 @@ # [72. 编辑距离](https://leetcode-cn.com/problems/edit-distance) +[English Version](/solution/0000-0099/0072.Edit%20Distance/README_EN.md) + ## 题目描述

给定两个单词 word1 和 word2，计算出将 word1 转换成 word2 所使用的最少操作数 。

diff --git a/solution/0000-0099/0072.Edit Distance/README_EN.md b/solution/0000-0099/0072.Edit Distance/README_EN.md index fd502c92fad5f..bcdc88394a611 100644 --- a/solution/0000-0099/0072.Edit Distance/README_EN.md +++ b/solution/0000-0099/0072.Edit Distance/README_EN.md @@ -1,5 +1,7 @@ # [72. Edit Distance](https://leetcode.com/problems/edit-distance) +[中文文档](/solution/0000-0099/0072.Edit%20Distance/README.md) + ## Description

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

diff --git a/solution/0000-0099/0073.Set Matrix Zeroes/README.md b/solution/0000-0099/0073.Set Matrix Zeroes/README.md index e3b25dae9da6d..1f8efbb10a16e 100644 --- a/solution/0000-0099/0073.Set Matrix Zeroes/README.md +++ b/solution/0000-0099/0073.Set Matrix Zeroes/README.md @@ -1,5 +1,7 @@ # [73. 矩阵置零](https://leetcode-cn.com/problems/set-matrix-zeroes) +[English Version](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README_EN.md) + ## 题目描述

给定一个 m x n 的矩阵，如果一个元素为 0，则将其所在行和列的所有元素都设为 0。请使用原地算法。

diff --git a/solution/0000-0099/0073.Set Matrix Zeroes/README_EN.md b/solution/0000-0099/0073.Set Matrix Zeroes/README_EN.md index 01aa49fc1f2cd..0d09cb4a4550f 100644 --- a/solution/0000-0099/0073.Set Matrix Zeroes/README_EN.md +++ b/solution/0000-0099/0073.Set Matrix Zeroes/README_EN.md @@ -1,5 +1,7 @@ # [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) +[中文文档](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md) + ## Description

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.

diff --git a/solution/0000-0099/0074.Search a 2D Matrix/README.md b/solution/0000-0099/0074.Search a 2D Matrix/README.md index 6592b80657aa6..0fde83b4965a4 100644 --- a/solution/0000-0099/0074.Search a 2D Matrix/README.md +++ b/solution/0000-0099/0074.Search a 2D Matrix/README.md @@ -1,5 +1,7 @@ # [74. 搜索二维矩阵](https://leetcode-cn.com/problems/search-a-2d-matrix) +[English Version](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README_EN.md) + ## 题目描述

编写一个高效的算法来判断 m x n 矩阵中，是否存在一个目标值。该矩阵具有如下特性：

diff --git a/solution/0000-0099/0074.Search a 2D Matrix/README_EN.md b/solution/0000-0099/0074.Search a 2D Matrix/README_EN.md index 42b5dfc1b72c1..50497987cafaa 100644 --- a/solution/0000-0099/0074.Search a 2D Matrix/README_EN.md +++ b/solution/0000-0099/0074.Search a 2D Matrix/README_EN.md @@ -1,5 +1,7 @@ # [74. Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) +[中文文档](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md) + ## Description

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

diff --git a/solution/0000-0099/0075.Sort Colors/README.md b/solution/0000-0099/0075.Sort Colors/README.md index 34ce392c3c227..0e28312ab4ded 100644 --- a/solution/0000-0099/0075.Sort Colors/README.md +++ b/solution/0000-0099/0075.Sort Colors/README.md @@ -1,5 +1,7 @@ # [75. 颜色分类](https://leetcode-cn.com/problems/sort-colors) +[English Version](/solution/0000-0099/0075.Sort%20Colors/README_EN.md) + ## 题目描述

给定一个包含红色、白色和蓝色，一共 n 个元素的数组，原地对它们进行排序，使得相同颜色的元素相邻，并按照红色、白色、蓝色顺序排列。

diff --git a/solution/0000-0099/0075.Sort Colors/README_EN.md b/solution/0000-0099/0075.Sort Colors/README_EN.md index 4e28f74feea2f..bbe83042d614d 100644 --- a/solution/0000-0099/0075.Sort Colors/README_EN.md +++ b/solution/0000-0099/0075.Sort Colors/README_EN.md @@ -1,5 +1,7 @@ # [75. Sort Colors](https://leetcode.com/problems/sort-colors) +[中文文档](/solution/0000-0099/0075.Sort%20Colors/README.md) + ## Description

Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.

diff --git a/solution/0000-0099/0076.Minimum Window Substring/README.md b/solution/0000-0099/0076.Minimum Window Substring/README.md index 0675b2d3918b1..34e7d93818c28 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/README.md +++ b/solution/0000-0099/0076.Minimum Window Substring/README.md @@ -1,5 +1,7 @@ # [76. 最小覆盖子串](https://leetcode-cn.com/problems/minimum-window-substring) +[English Version](/solution/0000-0099/0076.Minimum%20Window%20Substring/README_EN.md) + ## 题目描述

给你一个字符串 S、一个字符串 T，请在字符串 S 里面找出：包含 T 所有字母的最小子串。

diff --git a/solution/0000-0099/0076.Minimum Window Substring/README_EN.md b/solution/0000-0099/0076.Minimum Window Substring/README_EN.md index 84d4d7d56cc27..80534f0c34e79 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/README_EN.md +++ b/solution/0000-0099/0076.Minimum Window Substring/README_EN.md @@ -1,5 +1,7 @@ # [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) +[中文文档](/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md) + ## Description

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).

diff --git a/solution/0000-0099/0077.Combinations/README.md b/solution/0000-0099/0077.Combinations/README.md index fb540b5182421..50d5b83c98954 100644 --- a/solution/0000-0099/0077.Combinations/README.md +++ b/solution/0000-0099/0077.Combinations/README.md @@ -1,5 +1,7 @@ # [77. 组合](https://leetcode-cn.com/problems/combinations) +[English Version](/solution/0000-0099/0077.Combinations/README_EN.md) + ## 题目描述

给定两个整数 n 和 k，返回 1 ... n 中所有可能的 k 个数的组合。

diff --git a/solution/0000-0099/0077.Combinations/README_EN.md b/solution/0000-0099/0077.Combinations/README_EN.md index db4daff0bdc25..001a30305c770 100644 --- a/solution/0000-0099/0077.Combinations/README_EN.md +++ b/solution/0000-0099/0077.Combinations/README_EN.md @@ -1,5 +1,7 @@ # [77. Combinations](https://leetcode.com/problems/combinations) +[中文文档](/solution/0000-0099/0077.Combinations/README.md) + ## Description

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.

diff --git a/solution/0000-0099/0078.Subsets/README.md b/solution/0000-0099/0078.Subsets/README.md index 5cd3d459cce1b..9f139cde15a56 100644 --- a/solution/0000-0099/0078.Subsets/README.md +++ b/solution/0000-0099/0078.Subsets/README.md @@ -1,5 +1,7 @@ # [78. 子集](https://leetcode-cn.com/problems/subsets) +[English Version](/solution/0000-0099/0078.Subsets/README_EN.md) + ## 题目描述

给定一组不含重复元素的整数数组 nums，返回该数组所有可能的子集（幂集）。

diff --git a/solution/0000-0099/0078.Subsets/README_EN.md b/solution/0000-0099/0078.Subsets/README_EN.md index 8c602f5b76783..7e50c1e684fe5 100644 --- a/solution/0000-0099/0078.Subsets/README_EN.md +++ b/solution/0000-0099/0078.Subsets/README_EN.md @@ -1,5 +1,7 @@ # [78. Subsets](https://leetcode.com/problems/subsets) +[中文文档](/solution/0000-0099/0078.Subsets/README.md) + ## Description

Given a set of distinct integers, nums, return all possible subsets (the power set).

diff --git a/solution/0000-0099/0079.Word Search/README.md b/solution/0000-0099/0079.Word Search/README.md index 59e3c6f160d64..1be49f6a2ae38 100644 --- a/solution/0000-0099/0079.Word Search/README.md +++ b/solution/0000-0099/0079.Word Search/README.md @@ -1,5 +1,7 @@ # [79. 单词搜索](https://leetcode-cn.com/problems/word-search) +[English Version](/solution/0000-0099/0079.Word%20Search/README_EN.md) + ## 题目描述

给定一个二维网格和一个单词，找出该单词是否存在于网格中。

diff --git a/solution/0000-0099/0079.Word Search/README_EN.md b/solution/0000-0099/0079.Word Search/README_EN.md index 6bbf488284192..a66450fff14e1 100644 --- a/solution/0000-0099/0079.Word Search/README_EN.md +++ b/solution/0000-0099/0079.Word Search/README_EN.md @@ -1,5 +1,7 @@ # [79. Word Search](https://leetcode.com/problems/word-search) +[中文文档](/solution/0000-0099/0079.Word%20Search/README.md) + ## Description

Given a 2D board and a word, find if the word exists in the grid.

diff --git a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md index 1958aeed96b21..782b614b44d12 100644 --- a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md +++ b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md @@ -1,5 +1,7 @@ # [80. 删除排序数组中的重复项 II](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii) +[English Version](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md) + ## 题目描述

给定一个排序数组，你需要在原地删除重复出现的元素，使得每个元素最多出现两次，返回移除后数组的新长度。

diff --git a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md index 1191aa9315798..99e3b60dcc04e 100644 --- a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md +++ b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md @@ -1,5 +1,7 @@ # [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) +[中文文档](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md) + ## Description

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.

diff --git a/solution/0000-0099/0081.Search in Rotated Sorted Array II/README.md b/solution/0000-0099/0081.Search in Rotated Sorted Array II/README.md index c77b4a35a0721..b58718d9f6668 100644 --- a/solution/0000-0099/0081.Search in Rotated Sorted Array II/README.md +++ b/solution/0000-0099/0081.Search in Rotated Sorted Array II/README.md @@ -1,5 +1,7 @@ # [81. 搜索旋转排序数组 II](https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii) +[English Version](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README_EN.md) + ## 题目描述

假设按照升序排序的数组在预先未知的某个点上进行了旋转。

diff --git a/solution/0000-0099/0081.Search in Rotated Sorted Array II/README_EN.md b/solution/0000-0099/0081.Search in Rotated Sorted Array II/README_EN.md index 67ef4e1db1d2c..d17a8bd16cc27 100644 --- a/solution/0000-0099/0081.Search in Rotated Sorted Array II/README_EN.md +++ b/solution/0000-0099/0081.Search in Rotated Sorted Array II/README_EN.md @@ -1,5 +1,7 @@ # [81. Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) +[中文文档](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md) + ## Description

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

diff --git a/solution/0000-0099/0082.Remove Duplicates from Sorted List II/README.md b/solution/0000-0099/0082.Remove Duplicates from Sorted List II/README.md index e0dbb0d5ffe0c..cc89e3be94b35 100644 --- a/solution/0000-0099/0082.Remove Duplicates from Sorted List II/README.md +++ b/solution/0000-0099/0082.Remove Duplicates from Sorted List II/README.md @@ -1,5 +1,7 @@ # [82. 删除排序链表中的重复元素 II](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii) +[English Version](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README_EN.md) + ## 题目描述

给定一个排序链表，删除所有含有重复数字的节点，只保留原始链表中 没有重复出现 的数字。

diff --git a/solution/0000-0099/0082.Remove Duplicates from Sorted List II/README_EN.md b/solution/0000-0099/0082.Remove Duplicates from Sorted List II/README_EN.md index f5e42ce7826a5..91f6211ecd028 100644 --- a/solution/0000-0099/0082.Remove Duplicates from Sorted List II/README_EN.md +++ b/solution/0000-0099/0082.Remove Duplicates from Sorted List II/README_EN.md @@ -1,5 +1,7 @@ # [82. Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) +[中文文档](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md) + ## Description

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

diff --git a/solution/0000-0099/0083.Remove Duplicates from Sorted List/README.md b/solution/0000-0099/0083.Remove Duplicates from Sorted List/README.md index e38af99a9529c..7b20bf4ca7ac2 100644 --- a/solution/0000-0099/0083.Remove Duplicates from Sorted List/README.md +++ b/solution/0000-0099/0083.Remove Duplicates from Sorted List/README.md @@ -1,5 +1,7 @@ # [83. 删除排序链表中的重复元素](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list) +[English Version](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README_EN.md) + ## 题目描述

给定一个排序链表，删除所有重复的元素，使得每个元素只出现一次。

diff --git a/solution/0000-0099/0083.Remove Duplicates from Sorted List/README_EN.md b/solution/0000-0099/0083.Remove Duplicates from Sorted List/README_EN.md index 3f07b069fc2b5..3c4ceaa0b296f 100644 --- a/solution/0000-0099/0083.Remove Duplicates from Sorted List/README_EN.md +++ b/solution/0000-0099/0083.Remove Duplicates from Sorted List/README_EN.md @@ -1,5 +1,7 @@ # [83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) +[中文文档](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md) + ## Description

Given a sorted linked list, delete all duplicates such that each element appear only once.

diff --git a/solution/0000-0099/0084.Largest Rectangle in Histogram/README.md b/solution/0000-0099/0084.Largest Rectangle in Histogram/README.md index ba20012be125f..efdb44d883c31 100644 --- a/solution/0000-0099/0084.Largest Rectangle in Histogram/README.md +++ b/solution/0000-0099/0084.Largest Rectangle in Histogram/README.md @@ -1,5 +1,7 @@ # [84. 柱状图中最大的矩形](https://leetcode-cn.com/problems/largest-rectangle-in-histogram) +[English Version](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README_EN.md) + ## 题目描述

给定 n 个非负整数，用来表示柱状图中各个柱子的高度。每个柱子彼此相邻，且宽度为 1 。

diff --git a/solution/0000-0099/0084.Largest Rectangle in Histogram/README_EN.md b/solution/0000-0099/0084.Largest Rectangle in Histogram/README_EN.md index 02bb666b41bd2..1c840d9d785b0 100644 --- a/solution/0000-0099/0084.Largest Rectangle in Histogram/README_EN.md +++ b/solution/0000-0099/0084.Largest Rectangle in Histogram/README_EN.md @@ -1,5 +1,7 @@ # [84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) +[中文文档](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md) + ## Description

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

diff --git a/solution/0000-0099/0085.Maximal Rectangle/README.md b/solution/0000-0099/0085.Maximal Rectangle/README.md index 7fa1e8f055a29..1ba1ebb27969d 100644 --- a/solution/0000-0099/0085.Maximal Rectangle/README.md +++ b/solution/0000-0099/0085.Maximal Rectangle/README.md @@ -1,5 +1,7 @@ # [85. 最大矩形](https://leetcode-cn.com/problems/maximal-rectangle) +[English Version](/solution/0000-0099/0085.Maximal%20Rectangle/README_EN.md) + ## 题目描述

给定一个仅包含 0 和 1 的二维二进制矩阵，找出只包含 1 的最大矩形，并返回其面积。

diff --git a/solution/0000-0099/0085.Maximal Rectangle/README_EN.md b/solution/0000-0099/0085.Maximal Rectangle/README_EN.md index b6eb2bc776f9d..4b7a91424877b 100644 --- a/solution/0000-0099/0085.Maximal Rectangle/README_EN.md +++ b/solution/0000-0099/0085.Maximal Rectangle/README_EN.md @@ -1,5 +1,7 @@ # [85. Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) +[中文文档](/solution/0000-0099/0085.Maximal%20Rectangle/README.md) + ## Description

Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.

diff --git a/solution/0000-0099/0086.Partition List/README.md b/solution/0000-0099/0086.Partition List/README.md index d819b3450ced5..e44fb2c97e45f 100644 --- a/solution/0000-0099/0086.Partition List/README.md +++ b/solution/0000-0099/0086.Partition List/README.md @@ -1,5 +1,7 @@ # [86. 分隔链表](https://leetcode-cn.com/problems/partition-list) +[English Version](/solution/0000-0099/0086.Partition%20List/README_EN.md) + ## 题目描述

给定一个链表和一个特定值 x，对链表进行分隔，使得所有小于 x 的节点都在大于或等于 x 的节点之前。

diff --git a/solution/0000-0099/0086.Partition List/README_EN.md b/solution/0000-0099/0086.Partition List/README_EN.md index 9effba10fd9f5..45b2ce274a78f 100644 --- a/solution/0000-0099/0086.Partition List/README_EN.md +++ b/solution/0000-0099/0086.Partition List/README_EN.md @@ -1,5 +1,7 @@ # [86. Partition List](https://leetcode.com/problems/partition-list) +[中文文档](/solution/0000-0099/0086.Partition%20List/README.md) + ## Description

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

diff --git a/solution/0000-0099/0087.Scramble String/README.md b/solution/0000-0099/0087.Scramble String/README.md index 3eba62e0e51c0..7196b52032834 100644 --- a/solution/0000-0099/0087.Scramble String/README.md +++ b/solution/0000-0099/0087.Scramble String/README.md @@ -1,5 +1,7 @@ # [87. 扰乱字符串](https://leetcode-cn.com/problems/scramble-string) +[English Version](/solution/0000-0099/0087.Scramble%20String/README_EN.md) + ## 题目描述

给定一个字符串 s1，我们可以把它递归地分割成两个非空子字符串，从而将其表示为二叉树。

diff --git a/solution/0000-0099/0087.Scramble String/README_EN.md b/solution/0000-0099/0087.Scramble String/README_EN.md index 7fcc9e5aac96a..c6948694098fc 100644 --- a/solution/0000-0099/0087.Scramble String/README_EN.md +++ b/solution/0000-0099/0087.Scramble String/README_EN.md @@ -1,5 +1,7 @@ # [87. Scramble String](https://leetcode.com/problems/scramble-string) +[中文文档](/solution/0000-0099/0087.Scramble%20String/README.md) + ## Description

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.

diff --git a/solution/0000-0099/0088.Merge Sorted Array/README.md b/solution/0000-0099/0088.Merge Sorted Array/README.md index 57c1980cd2c94..3306d81aee89e 100644 --- a/solution/0000-0099/0088.Merge Sorted Array/README.md +++ b/solution/0000-0099/0088.Merge Sorted Array/README.md @@ -1,5 +1,7 @@ # [88. 合并两个有序数组](https://leetcode-cn.com/problems/merge-sorted-array) +[English Version](/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md) + ## 题目描述

给你两个有序整数数组 nums1 和 nums2，请你将 nums2 合并到 nums1 中，使 num1 成为一个有序数组。

diff --git a/solution/0000-0099/0088.Merge Sorted Array/README_EN.md b/solution/0000-0099/0088.Merge Sorted Array/README_EN.md index 61ebab4284e62..c880ae610b72f 100644 --- a/solution/0000-0099/0088.Merge Sorted Array/README_EN.md +++ b/solution/0000-0099/0088.Merge Sorted Array/README_EN.md @@ -1,5 +1,7 @@ # [88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) +[中文文档](/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md) + ## Description

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

diff --git a/solution/0000-0099/0089.Gray Code/README.md b/solution/0000-0099/0089.Gray Code/README.md index 094dbdca50c12..4d99822445f9b 100644 --- a/solution/0000-0099/0089.Gray Code/README.md +++ b/solution/0000-0099/0089.Gray Code/README.md @@ -1,5 +1,7 @@ # [89. 格雷编码](https://leetcode-cn.com/problems/gray-code) +[English Version](/solution/0000-0099/0089.Gray%20Code/README_EN.md) + ## 题目描述

格雷编码是一个二进制数字系统，在该系统中，两个连续的数值仅有一个位数的差异。

diff --git a/solution/0000-0099/0089.Gray Code/README_EN.md b/solution/0000-0099/0089.Gray Code/README_EN.md index 0e27f2c4e720b..e81cdceca878b 100644 --- a/solution/0000-0099/0089.Gray Code/README_EN.md +++ b/solution/0000-0099/0089.Gray Code/README_EN.md @@ -1,5 +1,7 @@ # [89. Gray Code](https://leetcode.com/problems/gray-code) +[中文文档](/solution/0000-0099/0089.Gray%20Code/README.md) + ## Description

The gray code is a binary numeral system where two successive values differ in only one bit.

diff --git a/solution/0000-0099/0090.Subsets II/README.md b/solution/0000-0099/0090.Subsets II/README.md index ac6152ff68774..0a08a88795bbe 100644 --- a/solution/0000-0099/0090.Subsets II/README.md +++ b/solution/0000-0099/0090.Subsets II/README.md @@ -1,5 +1,7 @@ # [90. 子集 II](https://leetcode-cn.com/problems/subsets-ii) +[English Version](/solution/0000-0099/0090.Subsets%20II/README_EN.md) + ## 题目描述

给定一个可能包含重复元素的整数数组 nums，返回该数组所有可能的子集（幂集）。

diff --git a/solution/0000-0099/0090.Subsets II/README_EN.md b/solution/0000-0099/0090.Subsets II/README_EN.md index e195b5dc57db3..11d53d3aa59e5 100644 --- a/solution/0000-0099/0090.Subsets II/README_EN.md +++ b/solution/0000-0099/0090.Subsets II/README_EN.md @@ -1,5 +1,7 @@ # [90. Subsets II](https://leetcode.com/problems/subsets-ii) +[中文文档](/solution/0000-0099/0090.Subsets%20II/README.md) + ## Description

Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).

diff --git a/solution/0000-0099/0091.Decode Ways/README.md b/solution/0000-0099/0091.Decode Ways/README.md index 1b5733f1951a8..f95ce72fc1c2a 100644 --- a/solution/0000-0099/0091.Decode Ways/README.md +++ b/solution/0000-0099/0091.Decode Ways/README.md @@ -1,5 +1,7 @@ # [91. 解码方法](https://leetcode-cn.com/problems/decode-ways) +[English Version](/solution/0000-0099/0091.Decode%20Ways/README_EN.md) + ## 题目描述

一条包含字母 A-Z 的消息通过以下方式进行了编码：

diff --git a/solution/0000-0099/0091.Decode Ways/README_EN.md b/solution/0000-0099/0091.Decode Ways/README_EN.md index 11077f19efc74..d125d66ade6de 100644 --- a/solution/0000-0099/0091.Decode Ways/README_EN.md +++ b/solution/0000-0099/0091.Decode Ways/README_EN.md @@ -1,5 +1,7 @@ # [91. Decode Ways](https://leetcode.com/problems/decode-ways) +[中文文档](/solution/0000-0099/0091.Decode%20Ways/README.md) + ## Description

A message containing letters from A-Z is being encoded to numbers using the following mapping:

diff --git a/solution/0000-0099/0092.Reverse Linked List II/README.md b/solution/0000-0099/0092.Reverse Linked List II/README.md index 23f9b340f8f47..59af2aaaab55d 100644 --- a/solution/0000-0099/0092.Reverse Linked List II/README.md +++ b/solution/0000-0099/0092.Reverse Linked List II/README.md @@ -1,5 +1,7 @@ # [92. 反转链表 II](https://leetcode-cn.com/problems/reverse-linked-list-ii) +[English Version](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README_EN.md) + ## 题目描述

反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。

diff --git a/solution/0000-0099/0092.Reverse Linked List II/README_EN.md b/solution/0000-0099/0092.Reverse Linked List II/README_EN.md index c8bb2cc8dd360..07775878ba889 100644 --- a/solution/0000-0099/0092.Reverse Linked List II/README_EN.md +++ b/solution/0000-0099/0092.Reverse Linked List II/README_EN.md @@ -1,5 +1,7 @@ # [92. Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) +[中文文档](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md) + ## Description

Reverse a linked list from position m to n. Do it in one-pass.

diff --git a/solution/0000-0099/0093.Restore IP Addresses/README.md b/solution/0000-0099/0093.Restore IP Addresses/README.md index 787031a951038..0ed15a0fa3862 100644 --- a/solution/0000-0099/0093.Restore IP Addresses/README.md +++ b/solution/0000-0099/0093.Restore IP Addresses/README.md @@ -1,5 +1,7 @@ # [93. 复原IP地址](https://leetcode-cn.com/problems/restore-ip-addresses) +[English Version](/solution/0000-0099/0093.Restore%20IP%20Addresses/README_EN.md) + ## 题目描述

给定一个只包含数字的字符串，复原它并返回所有可能的 IP 地址格式。

diff --git a/solution/0000-0099/0093.Restore IP Addresses/README_EN.md b/solution/0000-0099/0093.Restore IP Addresses/README_EN.md index d03a5bc6c5e7d..db16c12cb4a1d 100644 --- a/solution/0000-0099/0093.Restore IP Addresses/README_EN.md +++ b/solution/0000-0099/0093.Restore IP Addresses/README_EN.md @@ -1,5 +1,7 @@ # [93. Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) +[中文文档](/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md) + ## Description

Given a string containing only digits, restore it by returning all possible valid IP address combinations.

diff --git a/solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md b/solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md index 64e7226008216..8af4a86bdc4e1 100644 --- a/solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md +++ b/solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md @@ -1,5 +1,7 @@ # [94. 二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal) +[English Version](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README_EN.md) + ## 题目描述

给定一个二叉树，返回它的中序 遍历。

diff --git a/solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md b/solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md index 7cb3d52f58a18..56984f5cc8df8 100644 --- a/solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md +++ b/solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md @@ -1,5 +1,7 @@ # [94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) +[中文文档](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md) + ## Description

Given a binary tree, return the inorder traversal of its nodes' values.

diff --git a/solution/0000-0099/0095.Unique Binary Search Trees II/README.md b/solution/0000-0099/0095.Unique Binary Search Trees II/README.md index 2733cb118622c..80341cb831f86 100644 --- a/solution/0000-0099/0095.Unique Binary Search Trees II/README.md +++ b/solution/0000-0099/0095.Unique Binary Search Trees II/README.md @@ -1,5 +1,7 @@ # [95. 不同的二叉搜索树 II](https://leetcode-cn.com/problems/unique-binary-search-trees-ii) +[English Version](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README_EN.md) + ## 题目描述

给定一个整数 n，生成所有由 1 ... n 为节点所组成的二叉搜索树。

diff --git a/solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md b/solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md index de6c1ff69d00e..123b44b4f30c7 100644 --- a/solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md +++ b/solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md @@ -1,5 +1,7 @@ # [95. Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) +[中文文档](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md) + ## Description

Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n.

diff --git a/solution/0000-0099/0096.Unique Binary Search Trees/README.md b/solution/0000-0099/0096.Unique Binary Search Trees/README.md index 94c9ebff9252b..3bf57e10ec88d 100644 --- a/solution/0000-0099/0096.Unique Binary Search Trees/README.md +++ b/solution/0000-0099/0096.Unique Binary Search Trees/README.md @@ -1,5 +1,7 @@ # [96. 不同的二叉搜索树](https://leetcode-cn.com/problems/unique-binary-search-trees) +[English Version](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README_EN.md) + ## 题目描述

给定一个整数 n，求以 1 ... n 为节点组成的二叉搜索树有多少种？

diff --git a/solution/0000-0099/0096.Unique Binary Search Trees/README_EN.md b/solution/0000-0099/0096.Unique Binary Search Trees/README_EN.md index a408cb6b4e756..3bd2ce868fbb9 100644 --- a/solution/0000-0099/0096.Unique Binary Search Trees/README_EN.md +++ b/solution/0000-0099/0096.Unique Binary Search Trees/README_EN.md @@ -1,5 +1,7 @@ # [96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) +[中文文档](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md) + ## Description

Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n?

diff --git a/solution/0000-0099/0097.Interleaving String/README.md b/solution/0000-0099/0097.Interleaving String/README.md index e8b4c8d424305..1aa1ba2dab625 100644 --- a/solution/0000-0099/0097.Interleaving String/README.md +++ b/solution/0000-0099/0097.Interleaving String/README.md @@ -1,5 +1,7 @@ # [97. 交错字符串](https://leetcode-cn.com/problems/interleaving-string) +[English Version](/solution/0000-0099/0097.Interleaving%20String/README_EN.md) + ## 题目描述

给定三个字符串 s1, s2, s3, 验证 s3 是否是由 s1 和 s2 交错组成的。

diff --git a/solution/0000-0099/0097.Interleaving String/README_EN.md b/solution/0000-0099/0097.Interleaving String/README_EN.md index 0d3cd075db21b..50f6cda59a7e7 100644 --- a/solution/0000-0099/0097.Interleaving String/README_EN.md +++ b/solution/0000-0099/0097.Interleaving String/README_EN.md @@ -1,5 +1,7 @@ # [97. Interleaving String](https://leetcode.com/problems/interleaving-string) +[中文文档](/solution/0000-0099/0097.Interleaving%20String/README.md) + ## Description

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.

diff --git a/solution/0000-0099/0098.Validate Binary Search Tree/README.md b/solution/0000-0099/0098.Validate Binary Search Tree/README.md index 6641a70f9c50c..7e7a0cd707fed 100644 --- a/solution/0000-0099/0098.Validate Binary Search Tree/README.md +++ b/solution/0000-0099/0098.Validate Binary Search Tree/README.md @@ -1,5 +1,7 @@ # [98. 验证二叉搜索树](https://leetcode-cn.com/problems/validate-binary-search-tree) +[English Version](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README_EN.md) + ## 题目描述

给定一个二叉树，判断其是否是一个有效的二叉搜索树。

diff --git a/solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md b/solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md index 8a99b4e54a7eb..3ae7a7719cec4 100644 --- a/solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md +++ b/solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md @@ -1,5 +1,7 @@ # [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) +[中文文档](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md) + ## Description

Given a binary tree, determine if it is a valid binary search tree (BST).

diff --git a/solution/0000-0099/0099.Recover Binary Search Tree/README.md b/solution/0000-0099/0099.Recover Binary Search Tree/README.md index 20a54ea0c10ed..d288d103fdc23 100644 --- a/solution/0000-0099/0099.Recover Binary Search Tree/README.md +++ b/solution/0000-0099/0099.Recover Binary Search Tree/README.md @@ -1,5 +1,7 @@ # [99. 恢复二叉搜索树](https://leetcode-cn.com/problems/recover-binary-search-tree) +[English Version](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README_EN.md) + ## 题目描述

二叉搜索树中的两个节点被错误地交换。

diff --git a/solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md b/solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md index 1aaf9fba43420..457491de00cee 100644 --- a/solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md +++ b/solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md @@ -1,5 +1,7 @@ # [99. Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) +[中文文档](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md) + ## Description

Two elements of a binary search tree (BST) are swapped by mistake.

diff --git a/solution/0100-0199/0100.Same Tree/README.md b/solution/0100-0199/0100.Same Tree/README.md index 86492e365138d..3619c3dd53ddf 100644 --- a/solution/0100-0199/0100.Same Tree/README.md +++ b/solution/0100-0199/0100.Same Tree/README.md @@ -1,5 +1,7 @@ # [100. 相同的树](https://leetcode-cn.com/problems/same-tree) +[English Version](/solution/0100-0199/0100.Same%20Tree/README_EN.md) + ## 题目描述

给定两个二叉树，编写一个函数来检验它们是否相同。

diff --git a/solution/0100-0199/0100.Same Tree/README_EN.md b/solution/0100-0199/0100.Same Tree/README_EN.md index e8bd82bf69e37..368345c29be55 100644 --- a/solution/0100-0199/0100.Same Tree/README_EN.md +++ b/solution/0100-0199/0100.Same Tree/README_EN.md @@ -1,5 +1,7 @@ # [100. Same Tree](https://leetcode.com/problems/same-tree) +[中文文档](/solution/0100-0199/0100.Same%20Tree/README.md) + ## Description

Given two binary trees, write a function to check if they are the same or not.

diff --git a/solution/0100-0199/0101.Symmetric Tree/README.md b/solution/0100-0199/0101.Symmetric Tree/README.md index bed2ced65652c..9ecf7c3272f1a 100644 --- a/solution/0100-0199/0101.Symmetric Tree/README.md +++ b/solution/0100-0199/0101.Symmetric Tree/README.md @@ -1,5 +1,7 @@ # [101. 对称二叉树](https://leetcode-cn.com/problems/symmetric-tree) +[English Version](/solution/0100-0199/0101.Symmetric%20Tree/README_EN.md) + ## 题目描述

给定一个二叉树，检查它是否是镜像对称的。

diff --git a/solution/0100-0199/0101.Symmetric Tree/README_EN.md b/solution/0100-0199/0101.Symmetric Tree/README_EN.md index b70c5b1113843..d75f1542a3b6e 100644 --- a/solution/0100-0199/0101.Symmetric Tree/README_EN.md +++ b/solution/0100-0199/0101.Symmetric Tree/README_EN.md @@ -1,5 +1,7 @@ # [101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree) +[中文文档](/solution/0100-0199/0101.Symmetric%20Tree/README.md) + ## Description

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

diff --git a/solution/0100-0199/0102.Binary Tree Level Order Traversal/README.md b/solution/0100-0199/0102.Binary Tree Level Order Traversal/README.md index d9034264094db..969ef6865532f 100644 --- a/solution/0100-0199/0102.Binary Tree Level Order Traversal/README.md +++ b/solution/0100-0199/0102.Binary Tree Level Order Traversal/README.md @@ -1,5 +1,7 @@ # [102. 二叉树的层次遍历](https://leetcode-cn.com/problems/binary-tree-level-order-traversal) +[English Version](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README_EN.md) + ## 题目描述

给定一个二叉树，返回其按层次遍历的节点值。 （即逐层地，从左到右访问所有节点）。

diff --git a/solution/0100-0199/0102.Binary Tree Level Order Traversal/README_EN.md b/solution/0100-0199/0102.Binary Tree Level Order Traversal/README_EN.md index 818de3a8745a3..e712c78688245 100644 --- a/solution/0100-0199/0102.Binary Tree Level Order Traversal/README_EN.md +++ b/solution/0100-0199/0102.Binary Tree Level Order Traversal/README_EN.md @@ -1,5 +1,7 @@ # [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) +[中文文档](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md) + ## Description

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

diff --git a/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README.md b/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README.md index cdb1c05f7da0e..75ece96e292f5 100644 --- a/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README.md +++ b/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README.md @@ -1,5 +1,7 @@ # [103. 二叉树的锯齿形层次遍历](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal) +[English Version](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README_EN.md) + ## 题目描述

给定一个二叉树，返回其节点值的锯齿形层次遍历。（即先从左往右，再从右往左进行下一层遍历，以此类推，层与层之间交替进行）。

diff --git a/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README_EN.md b/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README_EN.md index 4b57ce871721f..68a038af80b8a 100644 --- a/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README_EN.md +++ b/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README_EN.md @@ -1,5 +1,7 @@ # [103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) +[中文文档](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md) + ## Description

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

diff --git a/solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md b/solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md index 0cc727f19ff88..f111d8367c20c 100644 --- a/solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md +++ b/solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md @@ -1,5 +1,7 @@ # [104. 二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree) +[English Version](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README_EN.md) + ## 题目描述

给定一个二叉树，找出其最大深度。

diff --git a/solution/0100-0199/0104.Maximum Depth of Binary Tree/README_EN.md b/solution/0100-0199/0104.Maximum Depth of Binary Tree/README_EN.md index 969bc9cd32f86..a49e7cbf3ae72 100644 --- a/solution/0100-0199/0104.Maximum Depth of Binary Tree/README_EN.md +++ b/solution/0100-0199/0104.Maximum Depth of Binary Tree/README_EN.md @@ -1,5 +1,7 @@ # [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) +[中文文档](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md) + ## Description

Given a binary tree, find its maximum depth.

diff --git a/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md b/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md index b5c5762cbf60f..6fddec0be4b71 100644 --- a/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md +++ b/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md @@ -1,5 +1,7 @@ # [105. 从前序与中序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) +[English Version](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README_EN.md) + ## 题目描述

根据一棵树的前序遍历与中序遍历构造二叉树。

diff --git a/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md b/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md index 3d755c1eba784..0ca32b7c6d18b 100644 --- a/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md +++ b/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md @@ -1,5 +1,7 @@ # [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) +[中文文档](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md) + ## Description

Given preorder and inorder traversal of a tree, construct the binary tree.

diff --git a/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md b/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md index 28723814bb38d..e03b9b9fbba7a 100644 --- a/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md +++ b/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md @@ -1,5 +1,7 @@ # [106. 从中序与后序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) +[English Version](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README_EN.md) + ## 题目描述

根据一棵树的中序遍历与后序遍历构造二叉树。

diff --git a/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md b/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md index 8a66bb8fd5271..f8e65e30dd26f 100644 --- a/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md +++ b/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md @@ -1,5 +1,7 @@ # [106. Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) +[中文文档](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md) + ## Description

Given inorder and postorder traversal of a tree, construct the binary tree.

diff --git a/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md b/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md index 811f29e194202..157e94c7b16e1 100644 --- a/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md +++ b/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md @@ -1,5 +1,7 @@ # [107. 二叉树的层次遍历 II](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii) +[English Version](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README_EN.md) + ## 题目描述

给定一个二叉树，返回其节点值自底向上的层次遍历。 （即按从叶子节点所在层到根节点所在的层，逐层从左向右遍历）

diff --git a/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md b/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md index 57f3f5e67c06b..7a3c0a15f86e7 100644 --- a/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md +++ b/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md @@ -1,5 +1,7 @@ # [107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) +[中文文档](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md) + ## Description

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

diff --git a/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md b/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md index c8286c49135fc..c932afd0ef78e 100644 --- a/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md +++ b/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md @@ -1,5 +1,7 @@ # [108. 将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree) +[English Version](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README_EN.md) + ## 题目描述

将一个按照升序排列的有序数组，转换为一棵高度平衡二叉搜索树。

diff --git a/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md b/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md index 8f8bc7242e5c6..50ad572b2fae1 100644 --- a/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md +++ b/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md @@ -1,5 +1,7 @@ # [108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) +[中文文档](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md) + ## Description

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

diff --git a/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README.md b/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README.md index bd6889f099664..21b142f40ea9a 100644 --- a/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README.md +++ b/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README.md @@ -1,5 +1,7 @@ # [109. 有序链表转换二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree) +[English Version](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README_EN.md) + ## 题目描述

给定一个单链表，其中的元素按升序排序，将其转换为高度平衡的二叉搜索树。

diff --git a/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README_EN.md b/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README_EN.md index 6485e2d97fb69..6a2eca49d1542 100644 --- a/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README_EN.md +++ b/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README_EN.md @@ -1,5 +1,7 @@ # [109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) +[中文文档](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md) + ## Description

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

diff --git a/solution/0100-0199/0110.Balanced Binary Tree/README.md b/solution/0100-0199/0110.Balanced Binary Tree/README.md index 7f0957bf01a8c..51f7e5fee936b 100644 --- a/solution/0100-0199/0110.Balanced Binary Tree/README.md +++ b/solution/0100-0199/0110.Balanced Binary Tree/README.md @@ -1,5 +1,7 @@ # [110. 平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree) +[English Version](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README_EN.md) + ## 题目描述

给定一个二叉树，判断它是否是高度平衡的二叉树。

diff --git a/solution/0100-0199/0110.Balanced Binary Tree/README_EN.md b/solution/0100-0199/0110.Balanced Binary Tree/README_EN.md index e7311dac2e96b..abcc8eb133a6c 100644 --- a/solution/0100-0199/0110.Balanced Binary Tree/README_EN.md +++ b/solution/0100-0199/0110.Balanced Binary Tree/README_EN.md @@ -1,5 +1,7 @@ # [110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) +[中文文档](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md) + ## Description

Given a binary tree, determine if it is height-balanced.

diff --git a/solution/0100-0199/0111.Minimum Depth of Binary Tree/README.md b/solution/0100-0199/0111.Minimum Depth of Binary Tree/README.md index f9ed577b826fb..0359edc04b973 100644 --- a/solution/0100-0199/0111.Minimum Depth of Binary Tree/README.md +++ b/solution/0100-0199/0111.Minimum Depth of Binary Tree/README.md @@ -1,5 +1,7 @@ # [111. 二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree) +[English Version](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README_EN.md) + ## 题目描述

给定一个二叉树，找出其最小深度。

diff --git a/solution/0100-0199/0111.Minimum Depth of Binary Tree/README_EN.md b/solution/0100-0199/0111.Minimum Depth of Binary Tree/README_EN.md index 61f5e520f4d28..e0822a1475ba8 100644 --- a/solution/0100-0199/0111.Minimum Depth of Binary Tree/README_EN.md +++ b/solution/0100-0199/0111.Minimum Depth of Binary Tree/README_EN.md @@ -1,5 +1,7 @@ # [111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) +[中文文档](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md) + ## Description

Given a binary tree, find its minimum depth.

diff --git a/solution/0100-0199/0112.Path Sum/README.md b/solution/0100-0199/0112.Path Sum/README.md index c447eb0985542..2567d5d2aa64f 100644 --- a/solution/0100-0199/0112.Path Sum/README.md +++ b/solution/0100-0199/0112.Path Sum/README.md @@ -1,5 +1,7 @@ # [112. 路径总和](https://leetcode-cn.com/problems/path-sum) +[English Version](/solution/0100-0199/0112.Path%20Sum/README_EN.md) + ## 题目描述

给定一个二叉树和一个目标和，判断该树中是否存在根节点到叶子节点的路径，这条路径上所有节点值相加等于目标和。

diff --git a/solution/0100-0199/0112.Path Sum/README_EN.md b/solution/0100-0199/0112.Path Sum/README_EN.md index 74fe7f93b5e45..0b243e525a964 100644 --- a/solution/0100-0199/0112.Path Sum/README_EN.md +++ b/solution/0100-0199/0112.Path Sum/README_EN.md @@ -1,5 +1,7 @@ # [112. Path Sum](https://leetcode.com/problems/path-sum) +[中文文档](/solution/0100-0199/0112.Path%20Sum/README.md) + ## Description

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

diff --git a/solution/0100-0199/0113.Path Sum II/README.md b/solution/0100-0199/0113.Path Sum II/README.md index f4182a828a75a..d53efa3b16c51 100644 --- a/solution/0100-0199/0113.Path Sum II/README.md +++ b/solution/0100-0199/0113.Path Sum II/README.md @@ -1,5 +1,7 @@ # [113. 路径总和 II](https://leetcode-cn.com/problems/path-sum-ii) +[English Version](/solution/0100-0199/0113.Path%20Sum%20II/README_EN.md) + ## 题目描述

给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。

diff --git a/solution/0100-0199/0113.Path Sum II/README_EN.md b/solution/0100-0199/0113.Path Sum II/README_EN.md index 69bb281f49dad..b369576a594df 100644 --- a/solution/0100-0199/0113.Path Sum II/README_EN.md +++ b/solution/0100-0199/0113.Path Sum II/README_EN.md @@ -1,5 +1,7 @@ # [113. Path Sum II](https://leetcode.com/problems/path-sum-ii) +[中文文档](/solution/0100-0199/0113.Path%20Sum%20II/README.md) + ## Description

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

diff --git a/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README.md b/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README.md index 76e0bbcb36f2d..22a3389d4b938 100644 --- a/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README.md +++ b/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README.md @@ -1,5 +1,7 @@ # [114. 二叉树展开为链表](https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list) +[English Version](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README_EN.md) + ## 题目描述

给定一个二叉树，原地将它展开为链表。

diff --git a/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README_EN.md b/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README_EN.md index cd86ec81450b4..352716c7de4ff 100644 --- a/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README_EN.md +++ b/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README_EN.md @@ -1,5 +1,7 @@ # [114. Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) +[中文文档](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md) + ## Description

Given a binary tree, flatten it to a linked list in-place.

diff --git a/solution/0100-0199/0115.Distinct Subsequences/README.md b/solution/0100-0199/0115.Distinct Subsequences/README.md index f19b0be2adf6c..697791d09b32c 100644 --- a/solution/0100-0199/0115.Distinct Subsequences/README.md +++ b/solution/0100-0199/0115.Distinct Subsequences/README.md @@ -1,5 +1,7 @@ # [115. 不同的子序列](https://leetcode-cn.com/problems/distinct-subsequences) +[English Version](/solution/0100-0199/0115.Distinct%20Subsequences/README_EN.md) + ## 题目描述

给定一个字符串 S 和一个字符串 T，计算在 S 的子序列中 T 出现的个数。

diff --git a/solution/0100-0199/0115.Distinct Subsequences/README_EN.md b/solution/0100-0199/0115.Distinct Subsequences/README_EN.md index 516ad7b7731ef..3e71c0e1f0264 100644 --- a/solution/0100-0199/0115.Distinct Subsequences/README_EN.md +++ b/solution/0100-0199/0115.Distinct Subsequences/README_EN.md @@ -1,5 +1,7 @@ # [115. Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) +[中文文档](/solution/0100-0199/0115.Distinct%20Subsequences/README.md) + ## Description

Given a string S and a string T, count the number of distinct subsequences of S which equals T.

diff --git a/solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README.md b/solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README.md index 7dacc4e8563c6..da3037ef9d4cd 100644 --- a/solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README.md +++ b/solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README.md @@ -1,5 +1,7 @@ # [116. 填充每个节点的下一个右侧节点指针](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node) +[English Version](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README_EN.md) + ## 题目描述

给定一个完美二叉树，其所有叶子节点都在同一层，每个父节点都有两个子节点。二叉树定义如下：

diff --git a/solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README_EN.md b/solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README_EN.md index 904919f38763e..2d7c32485936b 100644 --- a/solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README_EN.md +++ b/solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README_EN.md @@ -1,5 +1,7 @@ # [116. Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) +[中文文档](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md) + ## Description

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

diff --git a/solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README.md b/solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README.md index e2f5eb179b28c..798156734ff10 100644 --- a/solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README.md +++ b/solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README.md @@ -1,5 +1,7 @@ # [117. 填充每个节点的下一个右侧节点指针 II](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii) +[English Version](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README_EN.md) + ## 题目描述

给定一个二叉树

diff --git a/solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README_EN.md b/solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README_EN.md index 8ae86d5e56315..7348fb96b5948 100644 --- a/solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README_EN.md +++ b/solution/0100-0199/0117.Populating Next Right Pointers in Each Node II/README_EN.md @@ -1,5 +1,7 @@ # [117. Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) +[中文文档](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md) + ## Description

Given a binary tree

diff --git a/solution/0100-0199/0118.Pascal's Triangle/README.md b/solution/0100-0199/0118.Pascal's Triangle/README.md index 60d5eaf39b886..14cc74f16063b 100644 --- a/solution/0100-0199/0118.Pascal's Triangle/README.md +++ b/solution/0100-0199/0118.Pascal's Triangle/README.md @@ -1,5 +1,7 @@ # [118. 杨辉三角](https://leetcode-cn.com/problems/pascals-triangle) +[English Version](/solution/0100-0199/0118.Pascal's%20Triangle/README_EN.md) + ## 题目描述

给定一个非负整数 numRows，生成杨辉三角的前 numRows 行。

diff --git a/solution/0100-0199/0118.Pascal's Triangle/README_EN.md b/solution/0100-0199/0118.Pascal's Triangle/README_EN.md index 6ce98c9a2317d..6de5e56430cc6 100644 --- a/solution/0100-0199/0118.Pascal's Triangle/README_EN.md +++ b/solution/0100-0199/0118.Pascal's Triangle/README_EN.md @@ -1,5 +1,7 @@ # [118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) +[中文文档](/solution/0100-0199/0118.Pascal's%20Triangle/README.md) + ## Description

Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.

diff --git a/solution/0100-0199/0119.Pascal's Triangle II/README.md b/solution/0100-0199/0119.Pascal's Triangle II/README.md index a870a58d006ef..17afbcb40665b 100644 --- a/solution/0100-0199/0119.Pascal's Triangle II/README.md +++ b/solution/0100-0199/0119.Pascal's Triangle II/README.md @@ -1,5 +1,7 @@ # [119. 杨辉三角 II](https://leetcode-cn.com/problems/pascals-triangle-ii) +[English Version](/solution/0100-0199/0119.Pascal's%20Triangle%20II/README_EN.md) + ## 题目描述

给定一个非负索引 k，其中 k ≤ 33，返回杨辉三角的第 k 行。

diff --git a/solution/0100-0199/0119.Pascal's Triangle II/README_EN.md b/solution/0100-0199/0119.Pascal's Triangle II/README_EN.md index e1aeb003b9efd..69a04077c4109 100644 --- a/solution/0100-0199/0119.Pascal's Triangle II/README_EN.md +++ b/solution/0100-0199/0119.Pascal's Triangle II/README_EN.md @@ -1,5 +1,7 @@ # [119. Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) +[中文文档](/solution/0100-0199/0119.Pascal's%20Triangle%20II/README.md) + ## Description

Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle.

diff --git a/solution/0100-0199/0120.Triangle/README.md b/solution/0100-0199/0120.Triangle/README.md index 4a26c7f3a4ff5..c7424ca2e6810 100644 --- a/solution/0100-0199/0120.Triangle/README.md +++ b/solution/0100-0199/0120.Triangle/README.md @@ -1,5 +1,7 @@ # [120. 三角形最小路径和](https://leetcode-cn.com/problems/triangle) +[English Version](/solution/0100-0199/0120.Triangle/README_EN.md) + ## 题目描述

给定一个三角形，找出自顶向下的最小路径和。每一步只能移动到下一行中相邻的结点上。

diff --git a/solution/0100-0199/0120.Triangle/README_EN.md b/solution/0100-0199/0120.Triangle/README_EN.md index 819892c1270d3..9f040325f4e37 100644 --- a/solution/0100-0199/0120.Triangle/README_EN.md +++ b/solution/0100-0199/0120.Triangle/README_EN.md @@ -1,5 +1,7 @@ # [120. Triangle](https://leetcode.com/problems/triangle) +[中文文档](/solution/0100-0199/0120.Triangle/README.md) + ## Description

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

diff --git a/solution/0100-0199/0121.Best Time to Buy and Sell Stock/README.md b/solution/0100-0199/0121.Best Time to Buy and Sell Stock/README.md index 889a0e2ba3c4e..c1ebcaa461003 100644 --- a/solution/0100-0199/0121.Best Time to Buy and Sell Stock/README.md +++ b/solution/0100-0199/0121.Best Time to Buy and Sell Stock/README.md @@ -1,5 +1,7 @@ # [121. 买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock) +[English Version](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README_EN.md) + ## 题目描述

给定一个数组，它的第 i 个元素是一支给定股票第 i 天的价格。

diff --git a/solution/0100-0199/0121.Best Time to Buy and Sell Stock/README_EN.md b/solution/0100-0199/0121.Best Time to Buy and Sell Stock/README_EN.md index 5e009f977c645..61a5de7e54f16 100644 --- a/solution/0100-0199/0121.Best Time to Buy and Sell Stock/README_EN.md +++ b/solution/0100-0199/0121.Best Time to Buy and Sell Stock/README_EN.md @@ -1,5 +1,7 @@ # [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) +[中文文档](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md) + ## Description

Say you have an array for which the ith element is the price of a given stock on day i.

diff --git a/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README.md b/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README.md index 3dc2c5d0ce139..0827a65b60c08 100644 --- a/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README.md +++ b/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README.md @@ -1,5 +1,7 @@ # [122. 买卖股票的最佳时机 II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii) +[English Version](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README_EN.md) + ## 题目描述

给定一个数组，它的第 i 个元素是一支给定股票第 i 天的价格。

diff --git a/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README_EN.md b/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README_EN.md index f88ccea4ea3e8..0ae5643d6a583 100644 --- a/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README_EN.md +++ b/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README_EN.md @@ -1,5 +1,7 @@ # [122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) +[中文文档](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md) + ## Description

Say you have an array for which the ith element is the price of a given stock on day i.

diff --git a/solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README.md b/solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README.md index 32d3124b2ef7f..b256b8aca36cd 100644 --- a/solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README.md +++ b/solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README.md @@ -1,5 +1,7 @@ # [123. 买卖股票的最佳时机 III](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii) +[English Version](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README_EN.md) + ## 题目描述

给定一个数组，它的第 i 个元素是一支给定的股票在第 i 天的价格。

diff --git a/solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README_EN.md b/solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README_EN.md index 3581e4a351898..b4d8d1eca617b 100644 --- a/solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README_EN.md +++ b/solution/0100-0199/0123.Best Time to Buy and Sell Stock III/README_EN.md @@ -1,5 +1,7 @@ # [123. Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) +[中文文档](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md) + ## Description

Say you have an array for which the ith element is the price of a given stock on day i.

diff --git a/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md b/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md index d659748407981..0d666762f8ca9 100644 --- a/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md +++ b/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md @@ -1,5 +1,7 @@ # [124. 二叉树中的最大路径和](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum) +[English Version](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README_EN.md) + ## 题目描述

给定一个非空二叉树，返回其最大路径和。

diff --git a/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md b/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md index 2a5d40d7b302a..ecc6ed4fabc43 100644 --- a/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md +++ b/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md @@ -1,5 +1,7 @@ # [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) +[中文文档](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README.md) + ## Description

Given a non-empty binary tree, find the maximum path sum.

diff --git a/solution/0100-0199/0125.Valid Palindrome/README.md b/solution/0100-0199/0125.Valid Palindrome/README.md index 2aed1efc5a092..8937571686bc4 100644 --- a/solution/0100-0199/0125.Valid Palindrome/README.md +++ b/solution/0100-0199/0125.Valid Palindrome/README.md @@ -1,5 +1,7 @@ # [125. 验证回文串](https://leetcode-cn.com/problems/valid-palindrome) +[English Version](/solution/0100-0199/0125.Valid%20Palindrome/README_EN.md) + ## 题目描述

给定一个字符串，验证它是否是回文串，只考虑字母和数字字符，可以忽略字母的大小写。

diff --git a/solution/0100-0199/0125.Valid Palindrome/README_EN.md b/solution/0100-0199/0125.Valid Palindrome/README_EN.md index 8aea24cac430a..90cbfcf982972 100644 --- a/solution/0100-0199/0125.Valid Palindrome/README_EN.md +++ b/solution/0100-0199/0125.Valid Palindrome/README_EN.md @@ -1,5 +1,7 @@ # [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome) +[中文文档](/solution/0100-0199/0125.Valid%20Palindrome/README.md) + ## Description

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

diff --git a/solution/0100-0199/0126.Word Ladder II/README.md b/solution/0100-0199/0126.Word Ladder II/README.md index 47fc2757aeb77..266a881b4b34a 100644 --- a/solution/0100-0199/0126.Word Ladder II/README.md +++ b/solution/0100-0199/0126.Word Ladder II/README.md @@ -1,5 +1,7 @@ # [126. 单词接龙 II](https://leetcode-cn.com/problems/word-ladder-ii) +[English Version](/solution/0100-0199/0126.Word%20Ladder%20II/README_EN.md) + ## 题目描述

给定两个单词（beginWord 和 endWord）和一个字典 wordList，找出所有从 beginWord 到 endWord 的最短转换序列。转换需遵循如下规则：

diff --git a/solution/0100-0199/0126.Word Ladder II/README_EN.md b/solution/0100-0199/0126.Word Ladder II/README_EN.md index cbc49c4c85a7a..8945d68e4b420 100644 --- a/solution/0100-0199/0126.Word Ladder II/README_EN.md +++ b/solution/0100-0199/0126.Word Ladder II/README_EN.md @@ -1,5 +1,7 @@ # [126. Word Ladder II](https://leetcode.com/problems/word-ladder-ii) +[中文文档](/solution/0100-0199/0126.Word%20Ladder%20II/README.md) + ## Description

Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:

diff --git a/solution/0100-0199/0127.Word Ladder/README.md b/solution/0100-0199/0127.Word Ladder/README.md index 97508719e38e3..b9dec4b1addb0 100644 --- a/solution/0100-0199/0127.Word Ladder/README.md +++ b/solution/0100-0199/0127.Word Ladder/README.md @@ -1,5 +1,7 @@ # [127. 单词接龙](https://leetcode-cn.com/problems/word-ladder) +[English Version](/solution/0100-0199/0127.Word%20Ladder/README_EN.md) + ## 题目描述

给定两个单词（beginWord 和 endWord）和一个字典，找到从 beginWord 到 endWord 的最短转换序列的长度。转换需遵循如下规则：

diff --git a/solution/0100-0199/0127.Word Ladder/README_EN.md b/solution/0100-0199/0127.Word Ladder/README_EN.md index c832efc9dc6d0..5532897e8facb 100644 --- a/solution/0100-0199/0127.Word Ladder/README_EN.md +++ b/solution/0100-0199/0127.Word Ladder/README_EN.md @@ -1,5 +1,7 @@ # [127. Word Ladder](https://leetcode.com/problems/word-ladder) +[中文文档](/solution/0100-0199/0127.Word%20Ladder/README.md) + ## Description

Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that:

diff --git a/solution/0100-0199/0128.Longest Consecutive Sequence/README.md b/solution/0100-0199/0128.Longest Consecutive Sequence/README.md index 8b3283d9b5107..669f43a9ccc40 100644 --- a/solution/0100-0199/0128.Longest Consecutive Sequence/README.md +++ b/solution/0100-0199/0128.Longest Consecutive Sequence/README.md @@ -1,5 +1,7 @@ # [128. 最长连续序列](https://leetcode-cn.com/problems/longest-consecutive-sequence) +[English Version](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README_EN.md) + ## 题目描述

给定一个未排序的整数数组，找出最长连续序列的长度。

diff --git a/solution/0100-0199/0128.Longest Consecutive Sequence/README_EN.md b/solution/0100-0199/0128.Longest Consecutive Sequence/README_EN.md index 0bcfed937efed..02c69fe784e7a 100644 --- a/solution/0100-0199/0128.Longest Consecutive Sequence/README_EN.md +++ b/solution/0100-0199/0128.Longest Consecutive Sequence/README_EN.md @@ -1,5 +1,7 @@ # [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) +[中文文档](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README.md) + ## Description

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

diff --git a/solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md b/solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md index 2f8a750b3704e..3b1488ab21695 100644 --- a/solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md +++ b/solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md @@ -1,5 +1,7 @@ # [129. 求根到叶子节点数字之和](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers) +[English Version](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README_EN.md) + ## 题目描述

给定一个二叉树，它的每个结点都存放一个 0-9 的数字，每条从根到叶子节点的路径都代表一个数字。

diff --git a/solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md b/solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md index 043b4eeae566f..d1abd44a9bc97 100644 --- a/solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md +++ b/solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md @@ -1,5 +1,7 @@ # [129. Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) +[中文文档](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README.md) + ## Description

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.

diff --git a/solution/0100-0199/0130.Surrounded Regions/README.md b/solution/0100-0199/0130.Surrounded Regions/README.md index f8a536e9064c6..abe3491d2e689 100644 --- a/solution/0100-0199/0130.Surrounded Regions/README.md +++ b/solution/0100-0199/0130.Surrounded Regions/README.md @@ -1,5 +1,7 @@ # [130. 被围绕的区域](https://leetcode-cn.com/problems/surrounded-regions) +[English Version](/solution/0100-0199/0130.Surrounded%20Regions/README_EN.md) + ## 题目描述

给定一个二维的矩阵，包含 'X' 和 'O'（字母 O）。

diff --git a/solution/0100-0199/0130.Surrounded Regions/README_EN.md b/solution/0100-0199/0130.Surrounded Regions/README_EN.md index dc417baf3c1b3..7baaa27ce758e 100644 --- a/solution/0100-0199/0130.Surrounded Regions/README_EN.md +++ b/solution/0100-0199/0130.Surrounded Regions/README_EN.md @@ -1,5 +1,7 @@ # [130. Surrounded Regions](https://leetcode.com/problems/surrounded-regions) +[中文文档](/solution/0100-0199/0130.Surrounded%20Regions/README.md) + ## Description

Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.

diff --git a/solution/0100-0199/0131.Palindrome Partitioning/README.md b/solution/0100-0199/0131.Palindrome Partitioning/README.md index 648467ceca0fd..cc5fc2618b7eb 100644 --- a/solution/0100-0199/0131.Palindrome Partitioning/README.md +++ b/solution/0100-0199/0131.Palindrome Partitioning/README.md @@ -1,5 +1,7 @@ # [131. 分割回文串](https://leetcode-cn.com/problems/palindrome-partitioning) +[English Version](/solution/0100-0199/0131.Palindrome%20Partitioning/README_EN.md) + ## 题目描述

给定一个字符串 s，将 s 分割成一些子串，使每个子串都是回文串。

diff --git a/solution/0100-0199/0131.Palindrome Partitioning/README_EN.md b/solution/0100-0199/0131.Palindrome Partitioning/README_EN.md index 4d1f586ea5ff5..cdaf40438b637 100644 --- a/solution/0100-0199/0131.Palindrome Partitioning/README_EN.md +++ b/solution/0100-0199/0131.Palindrome Partitioning/README_EN.md @@ -1,5 +1,7 @@ # [131. Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) +[中文文档](/solution/0100-0199/0131.Palindrome%20Partitioning/README.md) + ## Description

Given a string s, partition s such that every substring of the partition is a palindrome.

diff --git a/solution/0100-0199/0132.Palindrome Partitioning II/README.md b/solution/0100-0199/0132.Palindrome Partitioning II/README.md index 99bdd2518be30..85fdeba48ed38 100644 --- a/solution/0100-0199/0132.Palindrome Partitioning II/README.md +++ b/solution/0100-0199/0132.Palindrome Partitioning II/README.md @@ -1,5 +1,7 @@ # [132. 分割回文串 II](https://leetcode-cn.com/problems/palindrome-partitioning-ii) +[English Version](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README_EN.md) + ## 题目描述

给定一个字符串 s，将 s 分割成一些子串，使每个子串都是回文串。

diff --git a/solution/0100-0199/0132.Palindrome Partitioning II/README_EN.md b/solution/0100-0199/0132.Palindrome Partitioning II/README_EN.md index df3ab6918d122..730206937fd48 100644 --- a/solution/0100-0199/0132.Palindrome Partitioning II/README_EN.md +++ b/solution/0100-0199/0132.Palindrome Partitioning II/README_EN.md @@ -1,5 +1,7 @@ # [132. Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) +[中文文档](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README.md) + ## Description

Given a string s, partition s such that every substring of the partition is a palindrome.

diff --git a/solution/0100-0199/0133.Clone Graph/README.md b/solution/0100-0199/0133.Clone Graph/README.md index b88e6aa2d4a0f..d63ca035b7fe3 100644 --- a/solution/0100-0199/0133.Clone Graph/README.md +++ b/solution/0100-0199/0133.Clone Graph/README.md @@ -1,5 +1,7 @@ # [133. 克隆图](https://leetcode-cn.com/problems/clone-graph) +[English Version](/solution/0100-0199/0133.Clone%20Graph/README_EN.md) + ## 题目描述

给你无向 连通 图中一个节点的引用，请你返回该图的 深拷贝（克隆）。

diff --git a/solution/0100-0199/0133.Clone Graph/README_EN.md b/solution/0100-0199/0133.Clone Graph/README_EN.md index 1c08ce210c573..e112de98f7184 100644 --- a/solution/0100-0199/0133.Clone Graph/README_EN.md +++ b/solution/0100-0199/0133.Clone Graph/README_EN.md @@ -1,5 +1,7 @@ # [133. Clone Graph](https://leetcode.com/problems/clone-graph) +[中文文档](/solution/0100-0199/0133.Clone%20Graph/README.md) + ## Description

Given a reference of a node in a connected undirected graph.

diff --git a/solution/0100-0199/0134.Gas Station/README.md b/solution/0100-0199/0134.Gas Station/README.md index 794f2062ba85e..53969a2a9ac69 100644 --- a/solution/0100-0199/0134.Gas Station/README.md +++ b/solution/0100-0199/0134.Gas Station/README.md @@ -1,5 +1,7 @@ # [134. 加油站](https://leetcode-cn.com/problems/gas-station) +[English Version](/solution/0100-0199/0134.Gas%20Station/README_EN.md) + ## 题目描述

在一条环路上有 N 个加油站，其中第 i 个加油站有汽油 gas[i] 升。

diff --git a/solution/0100-0199/0134.Gas Station/README_EN.md b/solution/0100-0199/0134.Gas Station/README_EN.md index 8082146c50ee0..a6d0313fb280a 100644 --- a/solution/0100-0199/0134.Gas Station/README_EN.md +++ b/solution/0100-0199/0134.Gas Station/README_EN.md @@ -1,5 +1,7 @@ # [134. Gas Station](https://leetcode.com/problems/gas-station) +[中文文档](/solution/0100-0199/0134.Gas%20Station/README.md) + ## Description

There are N gas stations along a circular route, where the amount of gas at station i is gas[i].

diff --git a/solution/0100-0199/0135.Candy/README.md b/solution/0100-0199/0135.Candy/README.md index 84a0ba116e8fb..0da185cb0d1e8 100644 --- a/solution/0100-0199/0135.Candy/README.md +++ b/solution/0100-0199/0135.Candy/README.md @@ -1,5 +1,7 @@ # [135. 分发糖果](https://leetcode-cn.com/problems/candy) +[English Version](/solution/0100-0199/0135.Candy/README_EN.md) + ## 题目描述

老师想给孩子们分发糖果，有 N 个孩子站成了一条直线，老师会根据每个孩子的表现，预先给他们评分。

diff --git a/solution/0100-0199/0135.Candy/README_EN.md b/solution/0100-0199/0135.Candy/README_EN.md index a551dfcd9ffda..951113ed77041 100644 --- a/solution/0100-0199/0135.Candy/README_EN.md +++ b/solution/0100-0199/0135.Candy/README_EN.md @@ -1,5 +1,7 @@ # [135. Candy](https://leetcode.com/problems/candy) +[中文文档](/solution/0100-0199/0135.Candy/README.md) + ## Description

There are N children standing in a line. Each child is assigned a rating value.

diff --git a/solution/0100-0199/0136.Single Number/README.md b/solution/0100-0199/0136.Single Number/README.md index 36e323dabb550..5ea7f52689765 100644 --- a/solution/0100-0199/0136.Single Number/README.md +++ b/solution/0100-0199/0136.Single Number/README.md @@ -1,5 +1,7 @@ # [136. 只出现一次的数字](https://leetcode-cn.com/problems/single-number) +[English Version](/solution/0100-0199/0136.Single%20Number/README_EN.md) + ## 题目描述

给定一个非空整数数组，除了某个元素只出现一次以外，其余每个元素均出现两次。找出那个只出现了一次的元素。

diff --git a/solution/0100-0199/0136.Single Number/README_EN.md b/solution/0100-0199/0136.Single Number/README_EN.md index 9805f7abe8367..60b6acdb4b5f6 100644 --- a/solution/0100-0199/0136.Single Number/README_EN.md +++ b/solution/0100-0199/0136.Single Number/README_EN.md @@ -1,5 +1,7 @@ # [136. Single Number](https://leetcode.com/problems/single-number) +[中文文档](/solution/0100-0199/0136.Single%20Number/README.md) + ## Description

Given a non-empty array of integers, every element appears twice except for one. Find that single one.

diff --git a/solution/0100-0199/0137.Single Number II/README.md b/solution/0100-0199/0137.Single Number II/README.md index 818cae5dfc92c..daaa272f04ca7 100644 --- a/solution/0100-0199/0137.Single Number II/README.md +++ b/solution/0100-0199/0137.Single Number II/README.md @@ -1,5 +1,7 @@ # [137. 只出现一次的数字 II](https://leetcode-cn.com/problems/single-number-ii) +[English Version](/solution/0100-0199/0137.Single%20Number%20II/README_EN.md) + ## 题目描述

给定一个非空整数数组，除了某个元素只出现一次以外，其余每个元素均出现了三次。找出那个只出现了一次的元素。

diff --git a/solution/0100-0199/0137.Single Number II/README_EN.md b/solution/0100-0199/0137.Single Number II/README_EN.md index 00ab6bbdab304..ab48436de8f81 100644 --- a/solution/0100-0199/0137.Single Number II/README_EN.md +++ b/solution/0100-0199/0137.Single Number II/README_EN.md @@ -1,5 +1,7 @@ # [137. Single Number II](https://leetcode.com/problems/single-number-ii) +[中文文档](/solution/0100-0199/0137.Single%20Number%20II/README.md) + ## Description

Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.

diff --git a/solution/0100-0199/0138.Copy List with Random Pointer/README.md b/solution/0100-0199/0138.Copy List with Random Pointer/README.md index f37f26c2a1015..0c11bc6a97843 100644 --- a/solution/0100-0199/0138.Copy List with Random Pointer/README.md +++ b/solution/0100-0199/0138.Copy List with Random Pointer/README.md @@ -1,5 +1,7 @@ # [138. 复制带随机指针的链表](https://leetcode-cn.com/problems/copy-list-with-random-pointer) +[English Version](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README_EN.md) + ## 题目描述

给定一个链表，每个节点包含一个额外增加的随机指针，该指针可以指向链表中的任何节点或空节点。

diff --git a/solution/0100-0199/0138.Copy List with Random Pointer/README_EN.md b/solution/0100-0199/0138.Copy List with Random Pointer/README_EN.md index 52a98ae051b14..2943bcd1aab50 100644 --- a/solution/0100-0199/0138.Copy List with Random Pointer/README_EN.md +++ b/solution/0100-0199/0138.Copy List with Random Pointer/README_EN.md @@ -1,5 +1,7 @@ # [138. Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) +[中文文档](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md) + ## Description

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

diff --git a/solution/0100-0199/0139.Word Break/README.md b/solution/0100-0199/0139.Word Break/README.md index 53863ff17b7f6..c895d5fcc4f4f 100644 --- a/solution/0100-0199/0139.Word Break/README.md +++ b/solution/0100-0199/0139.Word Break/README.md @@ -1,5 +1,7 @@ # [139. 单词拆分](https://leetcode-cn.com/problems/word-break) +[English Version](/solution/0100-0199/0139.Word%20Break/README_EN.md) + ## 题目描述

给定一个非空字符串 s 和一个包含非空单词列表的字典 wordDict，判定 s 是否可以被空格拆分为一个或多个在字典中出现的单词。

diff --git a/solution/0100-0199/0139.Word Break/README_EN.md b/solution/0100-0199/0139.Word Break/README_EN.md index 5e2e1cf85dafa..8a22fab944b13 100644 --- a/solution/0100-0199/0139.Word Break/README_EN.md +++ b/solution/0100-0199/0139.Word Break/README_EN.md @@ -1,5 +1,7 @@ # [139. Word Break](https://leetcode.com/problems/word-break) +[中文文档](/solution/0100-0199/0139.Word%20Break/README.md) + ## Description

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

diff --git a/solution/0100-0199/0140.Word Break II/README.md b/solution/0100-0199/0140.Word Break II/README.md index ed26b9fc2773d..c452d47af5a9e 100644 --- a/solution/0100-0199/0140.Word Break II/README.md +++ b/solution/0100-0199/0140.Word Break II/README.md @@ -1,5 +1,7 @@ # [140. 单词拆分 II](https://leetcode-cn.com/problems/word-break-ii) +[English Version](/solution/0100-0199/0140.Word%20Break%20II/README_EN.md) + ## 题目描述

给定一个非空字符串 s 和一个包含非空单词列表的字典 wordDict，在字符串中增加空格来构建一个句子，使得句子中所有的单词都在词典中。返回所有这些可能的句子。

diff --git a/solution/0100-0199/0140.Word Break II/README_EN.md b/solution/0100-0199/0140.Word Break II/README_EN.md index 2dd3ba8a6bab6..a2387fc4cabd5 100644 --- a/solution/0100-0199/0140.Word Break II/README_EN.md +++ b/solution/0100-0199/0140.Word Break II/README_EN.md @@ -1,5 +1,7 @@ # [140. Word Break II](https://leetcode.com/problems/word-break-ii) +[中文文档](/solution/0100-0199/0140.Word%20Break%20II/README.md) + ## Description

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.

diff --git a/solution/0100-0199/0141.Linked List Cycle/README.md b/solution/0100-0199/0141.Linked List Cycle/README.md index 3221cdad0deb7..5a07e9b884807 100644 --- a/solution/0100-0199/0141.Linked List Cycle/README.md +++ b/solution/0100-0199/0141.Linked List Cycle/README.md @@ -1,5 +1,7 @@ # [141. 环形链表](https://leetcode-cn.com/problems/linked-list-cycle) +[English Version](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md) + ## 题目描述

给定一个链表，判断链表中是否有环。

diff --git a/solution/0100-0199/0141.Linked List Cycle/README_EN.md b/solution/0100-0199/0141.Linked List Cycle/README_EN.md index 1ff970ff94a76..d603b64a30317 100644 --- a/solution/0100-0199/0141.Linked List Cycle/README_EN.md +++ b/solution/0100-0199/0141.Linked List Cycle/README_EN.md @@ -1,5 +1,7 @@ # [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) +[中文文档](/solution/0100-0199/0141.Linked%20List%20Cycle/README.md) + ## Description

Given a linked list, determine if it has a cycle in it.

diff --git a/solution/0100-0199/0142.Linked List Cycle II/README.md b/solution/0100-0199/0142.Linked List Cycle II/README.md index bf6265e04f630..00b616e152bf2 100644 --- a/solution/0100-0199/0142.Linked List Cycle II/README.md +++ b/solution/0100-0199/0142.Linked List Cycle II/README.md @@ -1,5 +1,7 @@ # [142. 环形链表 II](https://leetcode-cn.com/problems/linked-list-cycle-ii) +[English Version](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md) + ## 题目描述

给定一个链表，返回链表开始入环的第一个节点。 如果链表无环，则返回 null。

diff --git a/solution/0100-0199/0142.Linked List Cycle II/README_EN.md b/solution/0100-0199/0142.Linked List Cycle II/README_EN.md index c8deb03cc16be..cabeb9e7d6ee9 100644 --- a/solution/0100-0199/0142.Linked List Cycle II/README_EN.md +++ b/solution/0100-0199/0142.Linked List Cycle II/README_EN.md @@ -1,5 +1,7 @@ # [142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) +[中文文档](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md) + ## Description

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

diff --git a/solution/0100-0199/0143.Reorder List/README.md b/solution/0100-0199/0143.Reorder List/README.md index f7366953137ab..b9d6e6f26bce8 100644 --- a/solution/0100-0199/0143.Reorder List/README.md +++ b/solution/0100-0199/0143.Reorder List/README.md @@ -1,5 +1,7 @@ # [143. 重排链表](https://leetcode-cn.com/problems/reorder-list) +[English Version](/solution/0100-0199/0143.Reorder%20List/README_EN.md) + ## 题目描述

给定一个单链表 L：L0→L1→…→Ln-1→Ln ，
diff --git a/solution/0100-0199/0143.Reorder List/README_EN.md b/solution/0100-0199/0143.Reorder List/README_EN.md index a71efdeae4fcc..11025db0f4555 100644 --- a/solution/0100-0199/0143.Reorder List/README_EN.md +++ b/solution/0100-0199/0143.Reorder List/README_EN.md @@ -1,5 +1,7 @@ # [143. Reorder List](https://leetcode.com/problems/reorder-list) +[中文文档](/solution/0100-0199/0143.Reorder%20List/README.md) + ## Description

Given a singly linked list L: L0→L1→…→Ln-1→Ln,
diff --git a/solution/0100-0199/0144.Binary Tree Preorder Traversal/README.md b/solution/0100-0199/0144.Binary Tree Preorder Traversal/README.md index 8b398727cc187..176921b426a63 100644 --- a/solution/0100-0199/0144.Binary Tree Preorder Traversal/README.md +++ b/solution/0100-0199/0144.Binary Tree Preorder Traversal/README.md @@ -1,5 +1,7 @@ # [144. 二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal) +[English Version](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README_EN.md) + ## 题目描述

给定一个二叉树，返回它的 前序 遍历。

diff --git a/solution/0100-0199/0144.Binary Tree Preorder Traversal/README_EN.md b/solution/0100-0199/0144.Binary Tree Preorder Traversal/README_EN.md index 49173b1b008db..96a14ed933aa7 100644 --- a/solution/0100-0199/0144.Binary Tree Preorder Traversal/README_EN.md +++ b/solution/0100-0199/0144.Binary Tree Preorder Traversal/README_EN.md @@ -1,5 +1,7 @@ # [144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) +[中文文档](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md) + ## Description

Given a binary tree, return the preorder traversal of its nodes' values.

diff --git a/solution/0100-0199/0145.Binary Tree Postorder Traversal/README.md b/solution/0100-0199/0145.Binary Tree Postorder Traversal/README.md index 8b3abf33ca83d..af565cfdb2e76 100644 --- a/solution/0100-0199/0145.Binary Tree Postorder Traversal/README.md +++ b/solution/0100-0199/0145.Binary Tree Postorder Traversal/README.md @@ -1,5 +1,7 @@ # [145. 二叉树的后序遍历](https://leetcode-cn.com/problems/binary-tree-postorder-traversal) +[English Version](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README_EN.md) + ## 题目描述

给定一个二叉树，返回它的 后序 遍历。

diff --git a/solution/0100-0199/0145.Binary Tree Postorder Traversal/README_EN.md b/solution/0100-0199/0145.Binary Tree Postorder Traversal/README_EN.md index 26388c25765fc..0ebfc7e06a972 100644 --- a/solution/0100-0199/0145.Binary Tree Postorder Traversal/README_EN.md +++ b/solution/0100-0199/0145.Binary Tree Postorder Traversal/README_EN.md @@ -1,5 +1,7 @@ # [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) +[中文文档](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md) + ## Description

Given a binary tree, return the postorder traversal of its nodes' values.

diff --git a/solution/0100-0199/0146.Lru Cache/README.md b/solution/0100-0199/0146.Lru Cache/README.md index 578a5ba268296..9e048805a5fc8 100644 --- a/solution/0100-0199/0146.Lru Cache/README.md +++ b/solution/0100-0199/0146.Lru Cache/README.md @@ -1,5 +1,7 @@ # [146. LRU缓存机制](https://leetcode-cn.com/problems/lru-cache) +[English Version](/solution/0100-0199/0146.Lru%20Cache/README_EN.md) + ## 题目描述

运用你所掌握的数据结构，设计和实现一个  LRU (最近最少使用) 缓存机制。它应该支持以下操作： 获取数据 get 和 写入数据 put 。

diff --git a/solution/0100-0199/0146.Lru Cache/README_EN.md b/solution/0100-0199/0146.Lru Cache/README_EN.md index 4d77804183a4e..c036b1feaca13 100644 --- a/solution/0100-0199/0146.Lru Cache/README_EN.md +++ b/solution/0100-0199/0146.Lru Cache/README_EN.md @@ -1,5 +1,7 @@ # [146. LRU Cache](https://leetcode.com/problems/lru-cache) +[中文文档](/solution/0100-0199/0146.Lru%20Cache/README.md) + ## Description

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.

diff --git a/solution/0100-0199/0147.Insertion Sort List/README.md b/solution/0100-0199/0147.Insertion Sort List/README.md index 9c3fe71d65ef8..8f17e5bf0d67e 100644 --- a/solution/0100-0199/0147.Insertion Sort List/README.md +++ b/solution/0100-0199/0147.Insertion Sort List/README.md @@ -1,5 +1,7 @@ # [147. 对链表进行插入排序](https://leetcode-cn.com/problems/insertion-sort-list) +[English Version](/solution/0100-0199/0147.Insertion%20Sort%20List/README_EN.md) + ## 题目描述

对链表进行插入排序。

diff --git a/solution/0100-0199/0147.Insertion Sort List/README_EN.md b/solution/0100-0199/0147.Insertion Sort List/README_EN.md index 577e2fc8e3d1f..d64447373d89a 100644 --- a/solution/0100-0199/0147.Insertion Sort List/README_EN.md +++ b/solution/0100-0199/0147.Insertion Sort List/README_EN.md @@ -1,5 +1,7 @@ # [147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) +[中文文档](/solution/0100-0199/0147.Insertion%20Sort%20List/README.md) + ## Description

Sort a linked list using insertion sort.

diff --git a/solution/0100-0199/0148.Sort List/README.md b/solution/0100-0199/0148.Sort List/README.md index 96b6c0d2cf7bf..273f94ffc9eb0 100644 --- a/solution/0100-0199/0148.Sort List/README.md +++ b/solution/0100-0199/0148.Sort List/README.md @@ -1,5 +1,7 @@ # [148. 排序链表](https://leetcode-cn.com/problems/sort-list) +[English Version](/solution/0100-0199/0148.Sort%20List/README_EN.md) + ## 题目描述

在 O(n log n) 时间复杂度和常数级空间复杂度下，对链表进行排序。

diff --git a/solution/0100-0199/0148.Sort List/README_EN.md b/solution/0100-0199/0148.Sort List/README_EN.md index dc64c43a1635d..f8c4cb1401e32 100644 --- a/solution/0100-0199/0148.Sort List/README_EN.md +++ b/solution/0100-0199/0148.Sort List/README_EN.md @@ -1,5 +1,7 @@ # [148. Sort List](https://leetcode.com/problems/sort-list) +[中文文档](/solution/0100-0199/0148.Sort%20List/README.md) + ## Description

Sort a linked list in O(n log n) time using constant space complexity.

diff --git a/solution/0100-0199/0149.Max Points on a Line/README.md b/solution/0100-0199/0149.Max Points on a Line/README.md index e9f1b5eaddc80..ce607accddbaf 100644 --- a/solution/0100-0199/0149.Max Points on a Line/README.md +++ b/solution/0100-0199/0149.Max Points on a Line/README.md @@ -1,5 +1,7 @@ # [149. 直线上最多的点数](https://leetcode-cn.com/problems/max-points-on-a-line) +[English Version](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README_EN.md) + ## 题目描述

给定一个二维平面，平面上有 n 个点，求最多有多少个点在同一条直线上。

diff --git a/solution/0100-0199/0149.Max Points on a Line/README_EN.md b/solution/0100-0199/0149.Max Points on a Line/README_EN.md index 983b0d157d9ee..75101c4a67381 100644 --- a/solution/0100-0199/0149.Max Points on a Line/README_EN.md +++ b/solution/0100-0199/0149.Max Points on a Line/README_EN.md @@ -1,5 +1,7 @@ # [149. Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) +[中文文档](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md) + ## Description

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.

diff --git a/solution/0100-0199/0150.Evaluate Reverse Polish Notation/README.md b/solution/0100-0199/0150.Evaluate Reverse Polish Notation/README.md index 4c7ab58db963c..5d7fa91102ff5 100644 --- a/solution/0100-0199/0150.Evaluate Reverse Polish Notation/README.md +++ b/solution/0100-0199/0150.Evaluate Reverse Polish Notation/README.md @@ -1,5 +1,7 @@ # [150. 逆波兰表达式求值](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation) +[English Version](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README_EN.md) + ## 题目描述

根据逆波兰表示法，求表达式的值。

diff --git a/solution/0100-0199/0150.Evaluate Reverse Polish Notation/README_EN.md b/solution/0100-0199/0150.Evaluate Reverse Polish Notation/README_EN.md index 861e90c8bf9e6..99058b99f0352 100644 --- a/solution/0100-0199/0150.Evaluate Reverse Polish Notation/README_EN.md +++ b/solution/0100-0199/0150.Evaluate Reverse Polish Notation/README_EN.md @@ -1,5 +1,7 @@ # [150. Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) +[中文文档](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md) + ## Description

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

diff --git a/solution/0100-0199/0151.Reverse Words in a String/README.md b/solution/0100-0199/0151.Reverse Words in a String/README.md index 2def35ce7de5c..c03768b73732d 100644 --- a/solution/0100-0199/0151.Reverse Words in a String/README.md +++ b/solution/0100-0199/0151.Reverse Words in a String/README.md @@ -1,5 +1,7 @@ # [151. 翻转字符串里的单词](https://leetcode-cn.com/problems/reverse-words-in-a-string) +[English Version](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README_EN.md) + ## 题目描述

给定一个字符串，逐个翻转字符串中的每个单词。

diff --git a/solution/0100-0199/0151.Reverse Words in a String/README_EN.md b/solution/0100-0199/0151.Reverse Words in a String/README_EN.md index 0af9a26722e59..91aa38be326ce 100644 --- a/solution/0100-0199/0151.Reverse Words in a String/README_EN.md +++ b/solution/0100-0199/0151.Reverse Words in a String/README_EN.md @@ -1,5 +1,7 @@ # [151. Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) +[中文文档](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md) + ## Description

Given an input string, reverse the string word by word.

diff --git a/solution/0100-0199/0152.Maximum Product Subarray/README.md b/solution/0100-0199/0152.Maximum Product Subarray/README.md index 8c9fcf320bd87..3385b68ba2eda 100644 --- a/solution/0100-0199/0152.Maximum Product Subarray/README.md +++ b/solution/0100-0199/0152.Maximum Product Subarray/README.md @@ -1,5 +1,7 @@ # [152. 乘积最大子序列](https://leetcode-cn.com/problems/maximum-product-subarray) +[English Version](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md) + ## 题目描述

给定一个整数数组 nums ，找出一个序列中乘积最大的连续子序列（该序列至少包含一个数）。

diff --git a/solution/0100-0199/0152.Maximum Product Subarray/README_EN.md b/solution/0100-0199/0152.Maximum Product Subarray/README_EN.md index c6b852a968704..93a510bc00d6f 100644 --- a/solution/0100-0199/0152.Maximum Product Subarray/README_EN.md +++ b/solution/0100-0199/0152.Maximum Product Subarray/README_EN.md @@ -1,5 +1,7 @@ # [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) +[中文文档](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md) + ## Description

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.

diff --git a/solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README.md b/solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README.md index b6ad3186b494a..7d8f658bb546e 100644 --- a/solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README.md +++ b/solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README.md @@ -1,5 +1,7 @@ # [153. 寻找旋转排序数组中的最小值](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array) +[English Version](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README_EN.md) + ## 题目描述

假设按照升序排序的数组在预先未知的某个点上进行了旋转。

diff --git a/solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README_EN.md b/solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README_EN.md index 930a830031914..9b436f7a24d88 100644 --- a/solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README_EN.md +++ b/solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README_EN.md @@ -1,5 +1,7 @@ # [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) +[中文文档](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md) + ## Description

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

diff --git a/solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README.md b/solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README.md index 5ff00cf20650a..0bcc0da4aa076 100644 --- a/solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README.md +++ b/solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README.md @@ -1,5 +1,7 @@ # [154. 寻找旋转排序数组中的最小值 II](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii) +[English Version](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README_EN.md) + ## 题目描述

假设按照升序排序的数组在预先未知的某个点上进行了旋转。

diff --git a/solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README_EN.md b/solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README_EN.md index 7802afcb00c7c..08f335507ef59 100644 --- a/solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README_EN.md +++ b/solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README_EN.md @@ -1,5 +1,7 @@ # [154. Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) +[中文文档](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md) + ## Description

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

diff --git a/solution/0100-0199/0155.Min Stack/README.md b/solution/0100-0199/0155.Min Stack/README.md index cef9af5db7a2e..6b514f0f705c3 100644 --- a/solution/0100-0199/0155.Min Stack/README.md +++ b/solution/0100-0199/0155.Min Stack/README.md @@ -1,5 +1,7 @@ # [155. 最小栈](https://leetcode-cn.com/problems/min-stack) +[English Version](/solution/0100-0199/0155.Min%20Stack/README_EN.md) + ## 题目描述

设计一个支持 push，pop，top 操作，并能在常数时间内检索到最小元素的栈。

diff --git a/solution/0100-0199/0155.Min Stack/README_EN.md b/solution/0100-0199/0155.Min Stack/README_EN.md index 70615743e427a..884b6eb3e9b14 100644 --- a/solution/0100-0199/0155.Min Stack/README_EN.md +++ b/solution/0100-0199/0155.Min Stack/README_EN.md @@ -1,5 +1,7 @@ # [155. Min Stack](https://leetcode.com/problems/min-stack) +[中文文档](/solution/0100-0199/0155.Min%20Stack/README.md) + ## Description

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

diff --git a/solution/0100-0199/0156.Binary Tree Upside Down/README.md b/solution/0100-0199/0156.Binary Tree Upside Down/README.md index 3d31afe34381f..8691a4eabf9f3 100644 --- a/solution/0100-0199/0156.Binary Tree Upside Down/README.md +++ b/solution/0100-0199/0156.Binary Tree Upside Down/README.md @@ -1,5 +1,7 @@ # [156. 上下翻转二叉树](https://leetcode-cn.com/problems/binary-tree-upside-down) +[English Version](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README_EN.md) + ## 题目描述 None diff --git a/solution/0100-0199/0156.Binary Tree Upside Down/README_EN.md b/solution/0100-0199/0156.Binary Tree Upside Down/README_EN.md index 836522be9065b..76c9212559ea1 100644 --- a/solution/0100-0199/0156.Binary Tree Upside Down/README_EN.md +++ b/solution/0100-0199/0156.Binary Tree Upside Down/README_EN.md @@ -1,5 +1,7 @@ # [156. Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) +[中文文档](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md) + ## Description None diff --git a/solution/0100-0199/0157.Read N Characters Given Read4/README.md b/solution/0100-0199/0157.Read N Characters Given Read4/README.md index 0b493976564fc..c7a899a7c6a47 100644 --- a/solution/0100-0199/0157.Read N Characters Given Read4/README.md +++ b/solution/0100-0199/0157.Read N Characters Given Read4/README.md @@ -1,5 +1,7 @@ # [157. 用 Read4 读取 N 个字符](https://leetcode-cn.com/problems/read-n-characters-given-read4) +[English Version](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README_EN.md) + ## 题目描述 None diff --git a/solution/0100-0199/0157.Read N Characters Given Read4/README_EN.md b/solution/0100-0199/0157.Read N Characters Given Read4/README_EN.md index 0e6425e81eb1a..6e496e4439bbd 100644 --- a/solution/0100-0199/0157.Read N Characters Given Read4/README_EN.md +++ b/solution/0100-0199/0157.Read N Characters Given Read4/README_EN.md @@ -1,5 +1,7 @@ # [157. Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) +[中文文档](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md) + ## Description None diff --git a/solution/0100-0199/0158.Read N Characters Given Read4 II - Call multiple times/README.md b/solution/0100-0199/0158.Read N Characters Given Read4 II - Call multiple times/README.md index 87c70e4d806a7..bc0fbe1e8ceb6 100644 --- a/solution/0100-0199/0158.Read N Characters Given Read4 II - Call multiple times/README.md +++ b/solution/0100-0199/0158.Read N Characters Given Read4 II - Call multiple times/README.md @@ -1,5 +1,7 @@ # [158. 用 Read4 读取 N 个字符 II](https://leetcode-cn.com/problems/read-n-characters-given-read4-ii-call-multiple-times) +[English Version](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times/README_EN.md) + ## 题目描述 None diff --git a/solution/0100-0199/0158.Read N Characters Given Read4 II - Call multiple times/README_EN.md b/solution/0100-0199/0158.Read N Characters Given Read4 II - Call multiple times/README_EN.md index fcff85b3200eb..253e20a05bf2a 100644 --- a/solution/0100-0199/0158.Read N Characters Given Read4 II - Call multiple times/README_EN.md +++ b/solution/0100-0199/0158.Read N Characters Given Read4 II - Call multiple times/README_EN.md @@ -1,5 +1,7 @@ # [158. Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) +[中文文档](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times/README.md) + ## Description None diff --git a/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README.md b/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README.md index f07e16e416255..c444e3383108e 100644 --- a/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README.md +++ b/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README.md @@ -1,5 +1,7 @@ # [159. 至多包含两个不同字符的最长子串](https://leetcode-cn.com/problems/longest-substring-with-at-most-two-distinct-characters) +[English Version](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README_EN.md) + ## 题目描述 None diff --git a/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md b/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md index de6cb9fa73906..077cf4f6882cb 100644 --- a/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md +++ b/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md @@ -1,5 +1,7 @@ # [159. Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) +[中文文档](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md) + ## Description None diff --git a/solution/0100-0199/0160.Intersection of Two Linked Lists/README.md b/solution/0100-0199/0160.Intersection of Two Linked Lists/README.md index 6c4c101f3e044..504047fc6d1fc 100644 --- a/solution/0100-0199/0160.Intersection of Two Linked Lists/README.md +++ b/solution/0100-0199/0160.Intersection of Two Linked Lists/README.md @@ -1,5 +1,7 @@ # [160. 相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists) +[English Version](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README_EN.md) + ## 题目描述

编写一个程序，找到两个单链表相交的起始节点。

diff --git a/solution/0100-0199/0160.Intersection of Two Linked Lists/README_EN.md b/solution/0100-0199/0160.Intersection of Two Linked Lists/README_EN.md index 1fe612b41a229..cc4b972aa6a9d 100644 --- a/solution/0100-0199/0160.Intersection of Two Linked Lists/README_EN.md +++ b/solution/0100-0199/0160.Intersection of Two Linked Lists/README_EN.md @@ -1,5 +1,7 @@ # [160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) +[中文文档](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md) + ## Description

Write a program to find the node at which the intersection of two singly linked lists begins.

diff --git a/solution/0100-0199/0161.One Edit Distance/README.md b/solution/0100-0199/0161.One Edit Distance/README.md index 6e18703d63f9c..9b3187b4b83e4 100644 --- a/solution/0100-0199/0161.One Edit Distance/README.md +++ b/solution/0100-0199/0161.One Edit Distance/README.md @@ -1,5 +1,7 @@ # [161. 相隔为 1 的编辑距离](https://leetcode-cn.com/problems/one-edit-distance) +[English Version](/solution/0100-0199/0161.One%20Edit%20Distance/README_EN.md) + ## 题目描述 None diff --git a/solution/0100-0199/0161.One Edit Distance/README_EN.md b/solution/0100-0199/0161.One Edit Distance/README_EN.md index 492c6499cb5b2..30b0b43b5bf8d 100644 --- a/solution/0100-0199/0161.One Edit Distance/README_EN.md +++ b/solution/0100-0199/0161.One Edit Distance/README_EN.md @@ -1,5 +1,7 @@ # [161. One Edit Distance](https://leetcode.com/problems/one-edit-distance) +[中文文档](/solution/0100-0199/0161.One%20Edit%20Distance/README.md) + ## Description None diff --git a/solution/0100-0199/0162.Find Peak Element/README.md b/solution/0100-0199/0162.Find Peak Element/README.md index 8fd4e2d791047..96054d3f4c26e 100644 --- a/solution/0100-0199/0162.Find Peak Element/README.md +++ b/solution/0100-0199/0162.Find Peak Element/README.md @@ -1,5 +1,7 @@ # [162. 寻找峰值](https://leetcode-cn.com/problems/find-peak-element) +[English Version](/solution/0100-0199/0162.Find%20Peak%20Element/README_EN.md) + ## 题目描述

峰值元素是指其值大于左右相邻值的元素。

diff --git a/solution/0100-0199/0162.Find Peak Element/README_EN.md b/solution/0100-0199/0162.Find Peak Element/README_EN.md index 8d41b4aa8676b..063fd7fb35953 100644 --- a/solution/0100-0199/0162.Find Peak Element/README_EN.md +++ b/solution/0100-0199/0162.Find Peak Element/README_EN.md @@ -1,5 +1,7 @@ # [162. Find Peak Element](https://leetcode.com/problems/find-peak-element) +[中文文档](/solution/0100-0199/0162.Find%20Peak%20Element/README.md) + ## Description

A peak element is an element that is greater than its neighbors.

diff --git a/solution/0100-0199/0163.Missing Ranges/README.md b/solution/0100-0199/0163.Missing Ranges/README.md index 85fe881d0860e..3579a163f26c1 100644 --- a/solution/0100-0199/0163.Missing Ranges/README.md +++ b/solution/0100-0199/0163.Missing Ranges/README.md @@ -1,5 +1,7 @@ # [163. 缺失的区间](https://leetcode-cn.com/problems/missing-ranges) +[English Version](/solution/0100-0199/0163.Missing%20Ranges/README_EN.md) + ## 题目描述 None diff --git a/solution/0100-0199/0163.Missing Ranges/README_EN.md b/solution/0100-0199/0163.Missing Ranges/README_EN.md index 09ec179320db4..456cf92cf0cd8 100644 --- a/solution/0100-0199/0163.Missing Ranges/README_EN.md +++ b/solution/0100-0199/0163.Missing Ranges/README_EN.md @@ -1,5 +1,7 @@ # [163. Missing Ranges](https://leetcode.com/problems/missing-ranges) +[中文文档](/solution/0100-0199/0163.Missing%20Ranges/README.md) + ## Description None diff --git a/solution/0100-0199/0164.Maximum Gap/README.md b/solution/0100-0199/0164.Maximum Gap/README.md index 095ebae7ab31c..dedde8c673694 100644 --- a/solution/0100-0199/0164.Maximum Gap/README.md +++ b/solution/0100-0199/0164.Maximum Gap/README.md @@ -1,5 +1,7 @@ # [164. 最大间距](https://leetcode-cn.com/problems/maximum-gap) +[English Version](/solution/0100-0199/0164.Maximum%20Gap/README_EN.md) + ## 题目描述

给定一个无序的数组，找出数组在排序之后，相邻元素之间最大的差值。

diff --git a/solution/0100-0199/0164.Maximum Gap/README_EN.md b/solution/0100-0199/0164.Maximum Gap/README_EN.md index f58b6bfa3611e..1ebf70bb243d2 100644 --- a/solution/0100-0199/0164.Maximum Gap/README_EN.md +++ b/solution/0100-0199/0164.Maximum Gap/README_EN.md @@ -1,5 +1,7 @@ # [164. Maximum Gap](https://leetcode.com/problems/maximum-gap) +[中文文档](/solution/0100-0199/0164.Maximum%20Gap/README.md) + ## Description

Given an unsorted array, find the maximum difference between the successive elements in its sorted form.

diff --git a/solution/0100-0199/0165.Compare Version Numbers/README.md b/solution/0100-0199/0165.Compare Version Numbers/README.md index e3c132df78646..458eef8ab3d9a 100644 --- a/solution/0100-0199/0165.Compare Version Numbers/README.md +++ b/solution/0100-0199/0165.Compare Version Numbers/README.md @@ -1,5 +1,7 @@ # [165. 比较版本号](https://leetcode-cn.com/problems/compare-version-numbers) +[English Version](/solution/0100-0199/0165.Compare%20Version%20Numbers/README_EN.md) + ## 题目描述

比较两个版本号 version1 和 version2。
diff --git a/solution/0100-0199/0165.Compare Version Numbers/README_EN.md b/solution/0100-0199/0165.Compare Version Numbers/README_EN.md index ed2b83a7c4f27..f3713172229bd 100644 --- a/solution/0100-0199/0165.Compare Version Numbers/README_EN.md +++ b/solution/0100-0199/0165.Compare Version Numbers/README_EN.md @@ -1,5 +1,7 @@ # [165. Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) +[中文文档](/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md) + ## Description

Compare two version numbers version1 and version2.
diff --git a/solution/0100-0199/0166.Fraction to Recurring Decimal/README.md b/solution/0100-0199/0166.Fraction to Recurring Decimal/README.md index ecf9294ec7441..96dfc475b2a59 100644 --- a/solution/0100-0199/0166.Fraction to Recurring Decimal/README.md +++ b/solution/0100-0199/0166.Fraction to Recurring Decimal/README.md @@ -1,5 +1,7 @@ # [166. 分数到小数](https://leetcode-cn.com/problems/fraction-to-recurring-decimal) +[English Version](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README_EN.md) + ## 题目描述

给定两个整数，分别表示分数的分子 numerator 和分母 denominator，以字符串形式返回小数。

diff --git a/solution/0100-0199/0166.Fraction to Recurring Decimal/README_EN.md b/solution/0100-0199/0166.Fraction to Recurring Decimal/README_EN.md index c4bd28d58df45..ea42108b023e1 100644 --- a/solution/0100-0199/0166.Fraction to Recurring Decimal/README_EN.md +++ b/solution/0100-0199/0166.Fraction to Recurring Decimal/README_EN.md @@ -1,5 +1,7 @@ # [166. Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) +[中文文档](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md) + ## Description

Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.

diff --git a/solution/0100-0199/0167.Two Sum II - Input array is sorted/README.md b/solution/0100-0199/0167.Two Sum II - Input array is sorted/README.md index f0f245322feb6..8786fdc0aef66 100644 --- a/solution/0100-0199/0167.Two Sum II - Input array is sorted/README.md +++ b/solution/0100-0199/0167.Two Sum II - Input array is sorted/README.md @@ -1,5 +1,7 @@ # [167. 两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted) +[English Version](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20array%20is%20sorted/README_EN.md) + ## 题目描述

给定一个已按照升序排列 的有序数组，找到两个数使得它们相加之和等于目标数。

diff --git a/solution/0100-0199/0167.Two Sum II - Input array is sorted/README_EN.md b/solution/0100-0199/0167.Two Sum II - Input array is sorted/README_EN.md index 1c6b22fea319f..33d337e94e60a 100644 --- a/solution/0100-0199/0167.Two Sum II - Input array is sorted/README_EN.md +++ b/solution/0100-0199/0167.Two Sum II - Input array is sorted/README_EN.md @@ -1,5 +1,7 @@ # [167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) +[中文文档](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20array%20is%20sorted/README.md) + ## Description

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

diff --git a/solution/0100-0199/0168.Excel Sheet Column Title/README.md b/solution/0100-0199/0168.Excel Sheet Column Title/README.md index 22be2b8c903a3..a3c596748e4ab 100644 --- a/solution/0100-0199/0168.Excel Sheet Column Title/README.md +++ b/solution/0100-0199/0168.Excel Sheet Column Title/README.md @@ -1,5 +1,7 @@ # [168. Excel表列名称](https://leetcode-cn.com/problems/excel-sheet-column-title) +[English Version](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README_EN.md) + ## 题目描述

给定一个正整数，返回它在 Excel 表中相对应的列名称。

diff --git a/solution/0100-0199/0168.Excel Sheet Column Title/README_EN.md b/solution/0100-0199/0168.Excel Sheet Column Title/README_EN.md index 9475978039f25..5d2ed514ed4e9 100644 --- a/solution/0100-0199/0168.Excel Sheet Column Title/README_EN.md +++ b/solution/0100-0199/0168.Excel Sheet Column Title/README_EN.md @@ -1,5 +1,7 @@ # [168. Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) +[中文文档](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md) + ## Description

Given a positive integer, return its corresponding column title as appear in an Excel sheet.

diff --git a/solution/0100-0199/0169.Majority Element/README.md b/solution/0100-0199/0169.Majority Element/README.md index e8af332a34a17..33de71d6dea40 100644 --- a/solution/0100-0199/0169.Majority Element/README.md +++ b/solution/0100-0199/0169.Majority Element/README.md @@ -1,5 +1,7 @@ # [169. 多数元素](https://leetcode-cn.com/problems/majority-element) +[English Version](/solution/0100-0199/0169.Majority%20Element/README_EN.md) + ## 题目描述

给定一个大小为 n 的数组，找到其中的多数元素。多数元素是指在数组中出现次数大于 ⌊ n/2 ⌋ 的元素。

diff --git a/solution/0100-0199/0169.Majority Element/README_EN.md b/solution/0100-0199/0169.Majority Element/README_EN.md index 405b9516ae994..f14ba258ec417 100644 --- a/solution/0100-0199/0169.Majority Element/README_EN.md +++ b/solution/0100-0199/0169.Majority Element/README_EN.md @@ -1,5 +1,7 @@ # [169. Majority Element](https://leetcode.com/problems/majority-element) +[中文文档](/solution/0100-0199/0169.Majority%20Element/README.md) + ## Description

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

diff --git a/solution/0100-0199/0170.Two Sum III - Data structure design/README.md b/solution/0100-0199/0170.Two Sum III - Data structure design/README.md index d72d2334608a9..7e450c57ff199 100644 --- a/solution/0100-0199/0170.Two Sum III - Data structure design/README.md +++ b/solution/0100-0199/0170.Two Sum III - Data structure design/README.md @@ -1,5 +1,7 @@ # [170. 两数之和 III - 数据结构设计](https://leetcode-cn.com/problems/two-sum-iii-data-structure-design) +[English Version](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README_EN.md) + ## 题目描述 None diff --git a/solution/0100-0199/0170.Two Sum III - Data structure design/README_EN.md b/solution/0100-0199/0170.Two Sum III - Data structure design/README_EN.md index 3f939ada5fd7c..a12cbff522cb8 100644 --- a/solution/0100-0199/0170.Two Sum III - Data structure design/README_EN.md +++ b/solution/0100-0199/0170.Two Sum III - Data structure design/README_EN.md @@ -1,5 +1,7 @@ # [170. Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) +[中文文档](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md) + ## Description None diff --git a/solution/0100-0199/0171.Excel Sheet Column Number/README.md b/solution/0100-0199/0171.Excel Sheet Column Number/README.md index cab00ad831f8d..18216072f3f7e 100644 --- a/solution/0100-0199/0171.Excel Sheet Column Number/README.md +++ b/solution/0100-0199/0171.Excel Sheet Column Number/README.md @@ -1,5 +1,7 @@ # [171. Excel表列序号](https://leetcode-cn.com/problems/excel-sheet-column-number) +[English Version](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README_EN.md) + ## 题目描述

给定一个Excel表格中的列名称，返回其相应的列序号。

diff --git a/solution/0100-0199/0171.Excel Sheet Column Number/README_EN.md b/solution/0100-0199/0171.Excel Sheet Column Number/README_EN.md index 40fd4df959c0a..e3782b98e47b9 100644 --- a/solution/0100-0199/0171.Excel Sheet Column Number/README_EN.md +++ b/solution/0100-0199/0171.Excel Sheet Column Number/README_EN.md @@ -1,5 +1,7 @@ # [171. Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) +[中文文档](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README.md) + ## Description

Given a column title as appear in an Excel sheet, return its corresponding column number.

diff --git a/solution/0100-0199/0172.Factorial Trailing Zeroes/README.md b/solution/0100-0199/0172.Factorial Trailing Zeroes/README.md index f37f31d62c49e..1aa9641ca98ff 100644 --- a/solution/0100-0199/0172.Factorial Trailing Zeroes/README.md +++ b/solution/0100-0199/0172.Factorial Trailing Zeroes/README.md @@ -1,5 +1,7 @@ # [172. 阶乘后的零](https://leetcode-cn.com/problems/factorial-trailing-zeroes) +[English Version](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README_EN.md) + ## 题目描述

给定一个整数 n，返回 n! 结果尾数中零的数量。

diff --git a/solution/0100-0199/0172.Factorial Trailing Zeroes/README_EN.md b/solution/0100-0199/0172.Factorial Trailing Zeroes/README_EN.md index 0fb4a278d68d3..2c580b3ff463c 100644 --- a/solution/0100-0199/0172.Factorial Trailing Zeroes/README_EN.md +++ b/solution/0100-0199/0172.Factorial Trailing Zeroes/README_EN.md @@ -1,5 +1,7 @@ # [172. Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) +[中文文档](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README.md) + ## Description

Given an integer n, return the number of trailing zeroes in n!.

diff --git a/solution/0100-0199/0173.Binary Search Tree Iterator/README.md b/solution/0100-0199/0173.Binary Search Tree Iterator/README.md index 5b03294a401f4..9f1441c066d40 100644 --- a/solution/0100-0199/0173.Binary Search Tree Iterator/README.md +++ b/solution/0100-0199/0173.Binary Search Tree Iterator/README.md @@ -1,5 +1,7 @@ # [173. 二叉搜索树迭代器](https://leetcode-cn.com/problems/binary-search-tree-iterator) +[English Version](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README_EN.md) + ## 题目描述

实现一个二叉搜索树迭代器。你将使用二叉搜索树的根节点初始化迭代器。

diff --git a/solution/0100-0199/0173.Binary Search Tree Iterator/README_EN.md b/solution/0100-0199/0173.Binary Search Tree Iterator/README_EN.md index 56115b888d0d7..919c5cb78374e 100644 --- a/solution/0100-0199/0173.Binary Search Tree Iterator/README_EN.md +++ b/solution/0100-0199/0173.Binary Search Tree Iterator/README_EN.md @@ -1,5 +1,7 @@ # [173. Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) +[中文文档](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md) + ## Description

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

diff --git a/solution/0100-0199/0174.Dungeon Game/README.md b/solution/0100-0199/0174.Dungeon Game/README.md index 22ae11102432e..7441e4222d73d 100644 --- a/solution/0100-0199/0174.Dungeon Game/README.md +++ b/solution/0100-0199/0174.Dungeon Game/README.md @@ -1,5 +1,7 @@ # [174. 地下城游戏](https://leetcode-cn.com/problems/dungeon-game) +[English Version](/solution/0100-0199/0174.Dungeon%20Game/README_EN.md) + ## 题目描述