Repository navigation

leetcode

Public

About

leetcode --my solution

0 stars

1 watching

Report repository

Name		Name	Last commit message	Last commit date
2021		2021
2026		2026
hw_work		hw_work
001-Two Sum[数学逻辑].cpp		001-Two Sum[数学逻辑].cpp
002-[leetcode] Add Two Numbers[单链表].cpp		002-[leetcode] Add Two Numbers[单链表].cpp
README.md		README.md
[AtCoder] Beginner Contest 205.cpp		[AtCoder] Beginner Contest 205.cpp
[leetcode]003-Longest Substring Without Repeating Characters[动态规划].cpp		[leetcode]003-Longest Substring Without Repeating Characters[动态规划].cpp
[leetcode]004-Median of Two Sorted Arrays[二分查找].cpp		[leetcode]004-Median of Two Sorted Arrays[二分查找].cpp
[leetcode]005-Longest Palindromic Substring[动态规划].cpp		[leetcode]005-Longest Palindromic Substring[动态规划].cpp
[leetcode]006-ZigZag Conversion[快乐模拟].cpp		[leetcode]006-ZigZag Conversion[快乐模拟].cpp
[leetcode]007-Reverse Integer[数学逻辑].cpp		[leetcode]007-Reverse Integer[数学逻辑].cpp
[leetcode]008-String to Integer (atoi)[数理逻辑].cpp		[leetcode]008-String to Integer (atoi)[数理逻辑].cpp
[leetcode]009-Palindrome Number[字符处理].cpp		[leetcode]009-Palindrome Number[字符处理].cpp
[leetcode]010-Regular Expression Matching[递归].cpp		[leetcode]010-Regular Expression Matching[递归].cpp
[leetcode]011-Container With Most Water[贪心算法].cpp		[leetcode]011-Container With Most Water[贪心算法].cpp
[leetcode]012-Integer to Roman[数学逻辑].cpp		[leetcode]012-Integer to Roman[数学逻辑].cpp
[leetcode]013-Roman to Integer[字符处理].cpp		[leetcode]013-Roman to Integer[字符处理].cpp
[leetcode]014-Longest Common Prefix[字符串].cpp		[leetcode]014-Longest Common Prefix[字符串].cpp
[leetcode]015-3Sum[数学逻辑].cpp		[leetcode]015-3Sum[数学逻辑].cpp
[leetcode]016-3Sum Closest[数学逻辑].cpp		[leetcode]016-3Sum Closest[数学逻辑].cpp
[leetcode]017-Letter Combinations of a Phone Number[迭代].cpp		[leetcode]017-Letter Combinations of a Phone Number[迭代].cpp
[leetcode]018-4Sum[数学逻辑].cpp		[leetcode]018-4Sum[数学逻辑].cpp
[leetcode]019-Remove Nth Node From End of List[链表].cpp		[leetcode]019-Remove Nth Node From End of List[链表].cpp
[leetcode]020-Valid Parentheses[栈的应用].cpp		[leetcode]020-Valid Parentheses[栈的应用].cpp
[leetcode]021-Merge Two Sorted Lists[单链表].cpp		[leetcode]021-Merge Two Sorted Lists[单链表].cpp
[leetcode]022-Generate Parentheses[递归].cpp		[leetcode]022-Generate Parentheses[递归].cpp
[leetcode]023-Merge k Sorted Lists[单链表合并].cpp		[leetcode]023-Merge k Sorted Lists[单链表合并].cpp
[leetcode]024-Swap Nodes in Pairs[链表交换].cpp		[leetcode]024-Swap Nodes in Pairs[链表交换].cpp
[leetcode]024-Swap Nodes in Pairs[链表交换]2.cpp		[leetcode]024-Swap Nodes in Pairs[链表交换]2.cpp
[leetcode]025-Reverse Nodes in k-Group[单链表-递归].cpp		[leetcode]025-Reverse Nodes in k-Group[单链表-递归].cpp
[leetcode]026-Remove Duplicates from Sorted Array[数学逻辑].cpp		[leetcode]026-Remove Duplicates from Sorted Array[数学逻辑].cpp
[leetcode]027-Remove Element[数学逻辑].cpp		[leetcode]027-Remove Element[数学逻辑].cpp
[leetcode]028-Implement strStr()[字符串处理].cpp		[leetcode]028-Implement strStr()[字符串处理].cpp
[leetcode]029-Divide Two Integers[数学逻辑].cpp		[leetcode]029-Divide Two Integers[数学逻辑].cpp
[leetcode]030-Substring with Concatenation of All Words[数学逻辑map].cpp		[leetcode]030-Substring with Concatenation of All Words[数学逻辑map].cpp
[leetcode]031-Next Permutation[数学逻辑].py		[leetcode]031-Next Permutation[数学逻辑].py
[leetcode]032-Longest Valid Parentheses[动态规划].py		[leetcode]032-Longest Valid Parentheses[动态规划].py
[leetcode]033-Search in Rotated Sorted Array[二分查找].py		[leetcode]033-Search in Rotated Sorted Array[二分查找].py
[leetcode]034-Find First and Last Position of Element in Sorted Array[二分查找].py		[leetcode]034-Find First and Last Position of Element in Sorted Array[二分查找].py
[leetcode]035-Search Insert Position[二分查找].cpp		[leetcode]035-Search Insert Position[二分查找].cpp
[leetcode]036-Valid Sudoku[数理逻辑].py		[leetcode]036-Valid Sudoku[数理逻辑].py
[leetcode]037-Sudoku Solver[递归].cpp		[leetcode]037-Sudoku Solver[递归].cpp
[leetcode]038-Count and Say[字符串].py		[leetcode]038-Count and Say[字符串].py
[leetcode]039-Combination Sum[dfs剪枝].cpp		[leetcode]039-Combination Sum[dfs剪枝].cpp
[leetcode]040-Combination Sum II[dfs回溯].py		[leetcode]040-Combination Sum II[dfs回溯].py
[leetcode]041-First Missing Positive[数理逻辑].cpp		[leetcode]041-First Missing Positive[数理逻辑].cpp
[leetcode]042-Trapping Rain Water[数理逻辑].py		[leetcode]042-Trapping Rain Water[数理逻辑].py
[leetcode]043-Multiply Strings[数理逻辑].cpp		[leetcode]043-Multiply Strings[数理逻辑].cpp
[leetcode]044-Wildcard Matching[动态规划].py		[leetcode]044-Wildcard Matching[动态规划].py
[leetcode]045-Jump Game II[贪心算法].cpp		[leetcode]045-Jump Game II[贪心算法].cpp
[leetcode]046-Permutations[全排列-递归].py		[leetcode]046-Permutations[全排列-递归].py
[leetcode]047-Permutations II[全排列-递归].cpp		[leetcode]047-Permutations II[全排列-递归].cpp
[leetcode]048-Rotate Image[数学逻辑].py		[leetcode]048-Rotate Image[数学逻辑].py
[leetcode]049-Group Anagrams[字符串处理].cpp		[leetcode]049-Group Anagrams[字符串处理].cpp
[leetcode]050-Pow(x, n)[数理逻辑-递归].py		[leetcode]050-Pow(x, n)[数理逻辑-递归].py
[leetcode]050-Pow[数理逻辑-递归].py		[leetcode]050-Pow[数理逻辑-递归].py
[leetcode]051-N-Queens[递归回溯].cpp		[leetcode]051-N-Queens[递归回溯].cpp
[leetcode]052-N-Queens II[递归回溯].cpp		[leetcode]052-N-Queens II[递归回溯].cpp
[leetcode]054-Spiral Matrix[数学逻辑].cpp		[leetcode]054-Spiral Matrix[数学逻辑].cpp
[leetcode]175-Combine Two Tables[SQL].sql		[leetcode]175-Combine Two Tables[SQL].sql
[leetcode]188-Best Time to Buy and Sell Stock IV[DP].cpp		[leetcode]188-Best Time to Buy and Sell Stock IV[DP].cpp
[leetcode]218-The Skyline Problem[数学逻辑].cpp		[leetcode]218-The Skyline Problem[数学逻辑].cpp
[leetcode]227-Basic Calculator II[字符串].cpp		[leetcode]227-Basic Calculator II[字符串].cpp
[leetcode]332-Reconstruct Itinerary[集合映射].cpp		[leetcode]332-Reconstruct Itinerary[集合映射].cpp
[leetcode]546-remove box[dance links].cpp		[leetcode]546-remove box[dance links].cpp

Repository files navigation

leetcode

my solution

About

leetcode --my solution

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages