Skip to content

qijiaqi/Algorithme

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

105 Commits
LC101_symTree.cpp
LC101_symTree.cpp
 
 
LC102_levelOrder.cpp
LC102_levelOrder.cpp
 
 
LC104_maxDepth.cpp
LC104_maxDepth.cpp
 
 
LC108_arrayToBST.cpp
LC108_arrayToBST.cpp
 
 
LC111_minDepth.cpp
LC111_minDepth.cpp
 
 
LC115_distinctSubsequence.cpp
LC115_distinctSubsequence.cpp
 
 
LC120_triangle.cpp
LC120_triangle.cpp
 
 
LC121_bestTimeStock.cpp
LC121_bestTimeStock.cpp
 
 
LC122_bestTimeStock2.cpp
LC122_bestTimeStock2.cpp
 
 
LC123_bestTimeStock3.cpp
LC123_bestTimeStock3.cpp
 
 
LC1289_minFallingPath2.cpp
LC1289_minFallingPath2.cpp
 
 
LC1301_maxScorePaths.cpp
LC1301_maxScorePaths.cpp
 
 
LC141_cycleList.cpp
LC141_cycleList.cpp
 
 
LC152_maxProductSubarray.cpp
LC152_maxProductSubarray.cpp
 
 
LC1575_countAllRoutes.cpp
LC1575_countAllRoutes.cpp
 
 
LC15_3Sum.cpp
LC15_3Sum.cpp
 
 
LC172_factorialZeroes.cpp
LC172_factorialZeroes.cpp
 
 
LC188_bestTimeStock4.cpp
LC188_bestTimeStock4.cpp
 
 
LC190_reverseBit.cpp
LC190_reverseBit.cpp
 
 
LC198_houseRobber.cpp
LC198_houseRobber.cpp
 
 
LC19_removeNthNode.cpp
LC19_removeNthNode.cpp
 
 
LC204_countPrimes.cpp
LC204_countPrimes.cpp
 
 
LC206_reverseList.cpp
LC206_reverseList.cpp
 
 
LC20_validParentheses.cpp
LC20_validParentheses.cpp
 
 
LC21_mergeList.cpp
LC21_mergeList.cpp
 
 
LC234_palindromeList.cpp
LC234_palindromeList.cpp
 
 
LC2745_constructLongestString.cpp
LC2745_constructLongestString.cpp
 
 
LC2_addTwoNumbers.cpp
LC2_addTwoNumbers.cpp
 
 
LC300_longestSubsequence.cpp
LC300_longestSubsequence.cpp
 
 
LC309_bestTimeStockCooldown.cpp
LC309_bestTimeStockCooldown.cpp
 
 
LC319_bulb.cpp
LC319_bulb.cpp
 
 
LC31_nextPermutation.cpp
LC31_nextPermutation.cpp
 
 
LC322_coinChange.cpp
LC322_coinChange.cpp
 
 
LC365_waterJug.cpp
LC365_waterJug.cpp
 
 
LC376_wiggleSubsequence.cpp
LC376_wiggleSubsequence.cpp
 
 
LC3_norepeatSubstring.cpp
LC3_norepeatSubstring.cpp
 
 
LC416_subsetSum.cpp
LC416_subsetSum.cpp
 
 
LC45_jumpGame2.cpp
LC45_jumpGame2.cpp
 
 
LC50_power.cpp
LC50_power.cpp
 
 
LC518_coinChange2.cpp
LC518_coinChange2.cpp
 
 
LC53_maxSubarray.cpp
LC53_maxSubarray.cpp
 
 
LC55_jumpGame.cpp
LC55_jumpGame.cpp
 
 
LC576_boundaryPaths.cpp
LC576_boundaryPaths.cpp
 
 
LC581_shortestUnsortedSubarray.cpp
LC581_shortestUnsortedSubarray.cpp
 
 
LC5_longestPalindrome.cpp
LC5_longestPalindrome.cpp
 
 
LC64_minPathSum.cpp
LC64_minPathSum.cpp
 
 
LC66_plusOne.cpp
LC66_plusOne.cpp
 
 
LC67_addBinary.cpp
LC67_addBinary.cpp
 
 
LC704_binarySearch.cpp
LC704_binarySearch.cpp
 
 
LC714_bestTimeStockFee.cpp
LC714_bestTimeStockFee.cpp
 
 
LC7_reverseInteger.cpp
LC7_reverseInteger.cpp
 
 
LC931_minFallingPath.cpp
LC931_minFallingPath.cpp
 
 
LC98_validBST.cpp
LC98_validBST.cpp
 
 
README.md
README.md
 
 

Repository files navigation

Algorithme

Questions algorithmiques sur Leetcode

List of questions:

  1. Add Two Numbers: LinkedList with maths
  2. Longest Substring Without Repeating Characters: SW with O(n^2)
  3. Longest Palindromic Substring: DP with O(n^2) in reverse order
  4. Reverse Integer: overflow & conversion of type
  5. 3Sum: search without duplicate number
  6. Remove Nth Node From End of List: LinkedList with DummyHead
  7. Valid Parentheses: stack
  8. Merge Two Sorted Lists: LinkedList Iteration & Recursion
  9. Next Permutation: regularity
  10. Jump Game II: GR with dynamic loop
  11. Power(x, n): Maths with quick power O(logn)
  12. Maximum Subarray: DP & GR with O(n)
  13. Jump Game: GR with dynamic loop
  14. Minimum Path Sum: DP with O(n^2)
  15. Plus One: Maths with O(n)
  16. Add Binary: Maths with XOR O(n)
  17. Validate Binary Search Tree: BST & RC
  18. Symmetric Tree: BT & RC
  19. Binary Tree Level Order Traversal: BT & queue
  20. Maximum Depth of Binary Tree: BT & RC & queue
  21. Convert Sorted Array to Binary Search Tree: BST & RC
  22. Minimum Depth of Binary Tree: BT & RC & queue
  23. Distinct Subsequences: hard DP with O(n^2) & overflow
  24. Triangle: DP with O(n^2)
  25. Best Time to Buy and Sell Stock: DP with O(n) in different states
  26. Best Time to Buy and Sell Stock II
  27. Best Time to Buy and Sell Stock III
  28. Linked List Cycle: LinkedList with DoublePointer
  29. Maximum Product Subarray: 2 DP with O(n)
  30. Min Stack: Design
  31. Factorial Trailing Zeroes: Maths with O(logn)
  32. Best Time to Buy and Sell Stock IV: DP
  33. Reverse Bits: bit
  34. House Robber: DP with O(n)
  35. Count Primes: Maths with Eratosthenes O(nloglogn)
  36. Reverse Linked List: LinkedList with DummyHead & Stack & DoublePointer
  37. Palindrome Linked List: LinkedList with vector & DoublePointer
  38. Longest Increasing Subsequence: DP with O(n^2)
  39. Best Time to Buy and Sell Stock with Cooldown: DP
  40. Bulb Switcher: maths with square number O(n)
  41. Coin Change: DP with O(n^2)
  42. Water and Jug Problem: DFS & Bézout
  43. Wiggle Subsequence: 2 DP & GR with O(n)
  44. Shuffle an Array: Design
  45. Partition Equal Subset Sum: DP with O(n^2) in reverse order
  46. Coin Change II: DP with O(n^2)
  47. Out of Boundary Paths: DP with O(n^3)
  48. Shortest Unsorted Continuous Subarray: sort with O(n)
  49. Binary Search: BS
  50. Maximum Length of Repeated Subarray: DP with O(n^2)
  51. Minimum Falling Path Sum: DP with O(n^2)
  52. Minimum Falling Path Sum II: hard DP with O(n^2)
  53. Number of Paths with Max Score: hard DP with O(n^2)
  54. Count All Possible Routes: MS (DP & DFS) & hard DP with O(n^3)
  55. Construct the Longest New String : MS & DFS & Math wuth O(1)

About

Algorithms on Leetcode

leetcode.cn/u/qi-jia-qi/

Topics

algorithms-and-data-structures

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages