Skip to content

CHIINGTING/myLeetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

myLeetcode

       

LeetCode Solution in C img.png

Topics

Arrays

# Title Solution Difficulty
1 2-sum py EASY
11 Container With Most Water [py](arrays/container-with-most-water/container-with-most-water.py Medium
26 Remove Duplicates from Sorted Array C
py
EASY
27 Remove Element C
py
EASY
33 Search in Rotated Sorted Array py Medium
53 Maximum Subarray py Medium
121 Best Time to Buy and Sell Stock py EASY
152 Maximum Product Subarray py Medium
153 Find Minimum in Rotated Sorted Array py Medium
217 Contains Duplicate py EASY
238 Product of Array Except Self py Medium
283 Move Zeroes C
py
EASY
704 Binary Search C
py
EASY
844 Backspace String Compare py EASY
977 Squares of a Sorted Array py EASY
1768 Merge Strings Alternately py EASY

Bit

Linked List

# Title Solution Difficulty
21 Merge Two Sorted Lists C EASY
24 Swap Nodes in Pairs C MEDIUM
203 Remove Linked List Elements C EASY
206 Reverse Linked List C EASY
707 Design Linked List C MEDIUM

Hash Table

# Title Solution Difficulty
1 2-sum C
py
EASY
242 Valid Anagram C EASY
349 Intersection of Two Arrays C EASY
454 4 sum II C MEDIUM
1002 Find Common Characters C EASY

String

# Title Solution Difficulty
5 [Longest Palindromic Substring]
14 Longest Common Prefix C EASY

Double pointer

Stack/Queue

Tree

# Title Solution Difficulty
94 Binary Tree Inorder Traversal C EASY
144 Binary Tree Preorder Traversal C EASY
145 Binary Tree Postorder Traversal C EASY
222 Count Complete Tree Nodes C EASY

Heap

Graph

Greedy

Backtracking

Divide and Conquer

Dynamic Programming

# Title Solution Difficulty
5 Longest Palindromic Substring py Medium
39 Combination Sum py Medium
70 Climbing Stairs C
py
EASY
139 Word Break py Medium
300 Longest Increasing Subsequence py Medium
322 Coin Change py Medium
1143 Longest Common Subsequence py Medium

img_1.png img_2.png

Algorithm

Algorithm Solution Proposal
動態規劃 在處理字串、數列或序列相關的問題時,計算兩個序列的相似性或關係。
  • 最長公共子序列(LCS)

  • 編輯距離(Edit Distance)

  • 最長遞增子序列(LIS)

  • 路徑優化問題
    分割與組合問題
  • 01 背包問題

  • 數學與計算問題
  • 費波那契數列
  • Kadane's 最大子陣列和問題
  • $$dp[i] = \max(nums[i], dp[i-1] + nums[i])$$
  • 歸納法 踩樓梯問題:
  • $$(dp[i]=dp[i−1]+dp[i−2])$$

  • 硬幣總和問題:
  • $$(dp[i]=min(dp[i],dp[i−coin]+1) ∀ coin in coins$$

  • 硬幣組合:
  • $$(dp[i]=dp[i]+dp[i−coin])$$
  • Backtracking(回朔法) Combination Sum 問題

    About

    No description, website, or topics provided.

    Resources

    Stars

    Watchers

    Forks

    Releases

    No releases published

    Packages

    No packages published