{"id":18520315,"url":"https://github.com/hmes98318/leetcode","last_synced_at":"2026-03-19T04:53:56.331Z","repository":{"id":108111110,"uuid":"461787950","full_name":"hmes98318/LeetCode","owner":"hmes98318","description":"LeetCode 刷題紀錄","archived":false,"fork":false,"pushed_at":"2024-04-12T03:34:13.000Z","size":275,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-02-17T05:14:01.486Z","etag":null,"topics":["leetcode","leetcode-cpp","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hmes98318.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-02-21T09:23:09.000Z","updated_at":"2022-12-21T03:12:39.000Z","dependencies_parsed_at":"2023-12-25T19:56:08.733Z","dependency_job_id":"4bad2f6a-3314-43a2-9b66-7009eecbe9bd","html_url":"https://github.com/hmes98318/LeetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hmes98318%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hmes98318%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hmes98318%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hmes98318%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hmes98318","download_url":"https://codeload.github.com/hmes98318/LeetCode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254190422,"owners_count":22029635,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["leetcode","leetcode-cpp","leetcode-solutions"],"created_at":"2024-11-06T17:19:39.171Z","updated_at":"2026-03-19T04:53:56.292Z","avatar_url":"https://github.com/hmes98318.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode\n\n\n### Data Structure\n[217. Contains_Duplicate](/problems/217.Contains_Duplicate.md) - 存在重複元素  \n[53. Maximum_Subarray](/problems/53.Maximum_Subarray.md) - 最大子數和  \n[1. Two Sum](/problems/1.Two_Sum.md) - 兩數之和  \n[88. Merge Sorted Array](/problems/88.Merge_Sorted_Array.md) - 合併兩個數組  \n[350. Intersection of Two Arrays II](/problems/350.Intersection_of_Two_Arrays_II.md) - 兩數的交集  \n[121. Best Time to Buy and Sell Stock](/problems/121.Best_Time_to_Buy_and_Sell_Stock.md) - 最佳利潤  \n[566. Reshape the Matrix](/problems/566.Reshape_the_Matrix.md) - 重塑矩陣  \n[118. Pascal's Triangle](/problems/118.Pascal's_Triangle.md) - 帕斯卡三角形  \n[36. Valid Sudoku](/problems/36.Valid_Sudoku.md) - 有效數獨  \n[74. Search a 2D Matrix](/problems/74.Search_a_2D_Matrix.md) - 搜索二維矩陣  \n[387. First Unique Character in a String](/problems/387.First_Unique_Character_in_a_String.md) - 字符串中的第一個唯一字符  \n[383. Ransom Note](/problems/383.Ransom_Note.md) - 贖金信  \n[242. Valid Anagram](/problems/242.Valid_Anagram.md) - 有效的字謎  \n[141. Linked List Cycle](/problems/141.Linked_List_Cycle.md) - 循環列表  \n[21. Merge Two Sorted Lists](/problems/21.Merge_Two_Sorted_Lists.md) - 合併兩個有序列表  \n[203. Remove Linked List Elements](/problems/203.Remove_Linked_List_Elements.md) - 移除列表元素  \n[206. Reverse Linked List](/problems/206.Reverse_Linked_List.md) - 翻轉列表  \n[83. Remove Duplicates from Sorted List](/problems/83.Remove_Duplicates_from_Sorted_List.md) - 移除列表重複元素  \n[413. Arithmetic Slices](/problems/413.Arithmetic_Slices.md) - 算術切片  \n[20. Valid Parentheses](/problems/20.Valid_Parentheses.md) - 有效括號  \n[232. Implement Queue using Stacks](/problems/232.Implement_Queue_using_Stacks.md) - 用堆疊(Stack)實現列隊(Queue)  \n[144. Binary Tree Preorder Traversal](/problems/144.Binary_Tree_Preorder_Traversal.md) - 二元樹前序遍歷  \n[94. Binary Tree Inorder Traversal](/problems/94.Binary_Tree_Inorder_Traversal.md) - 二元樹中序遍歷  \n[145. Binary Tree Postorder Traversal](/problems/145.Binary_Tree_Postorder_Traversal.md) - 二元樹後序遍歷  \n[102. Binary Tree Level Order Traversal](/problems/102.Binary_Tree_Level_Order_Traversal.md) - 二元樹層序遍歷  \n[104. Maximum Depth of Binary Tree](/problems/104.Maximum_Depth_of_Binary_Tree.md) - 二元樹最大深度  \n[101. Symmetric Tree](/problems/101.Symmetric_Tree.md) - 二元樹對稱  \n[226. Invert Binary Tree](/problems/226.Invert_Binary_Tree.md) - 二元樹反轉  \n[112. Path Sum](/problems/112.Path_Sum.md) - 二元樹路徑總和  \n[700. Search in a Binary Search Tree](/problems/700.Search_in_a_Binary_Search_Tree.md) - 二元樹搜尋  \n[701. Insert into a Binary Search Tree](/problems/701.Insert_into_a_Binary_Search_Tree.md) - 二元樹插入  \n[98. Validate Binary Search Tree](/problems/98.Validate_Binary_Search_Tree.md) - 二元樹是否成立  \n[653. Two Sum IV - Input is a BST](/problems/653.Two_Sum_IV_Input_is_a_BST.md) - 兩數之和 4 (BST)  \n[235. Lowest Common Ancestor of a Binary Search Tree](/problems/235.Lowest_Common_Ancestor_of_a_Binary_Search_Tree.md) - 二元樹最近共同祖先  \n\n### Algorithms\n[704. Binary Search](/problems/704.Binary_Search.md) - 二元搜尋  \n[278. First Bad Version](/problems/278.First_Bad_Version.md) - 第一個壞版本  \n[35. Search Insert Position](/problems/35.Search_Insert_Position.md) - 搜尋插入位置  \n[977. Squares of a Sorted Array](/problems/977.Squares_of_a_Sorted_Array.md) - 有序數組的平方  \n[189. Rotate Array](/problems/189.Rotate_Array.md) - 旋轉陣列  \n[283. Move Zeroes](/problems/283.Move_Zeroes.md) - 移動零  \n[167. Two Sum II - Input Array Is Sorted](/problems/167.Two_Sum_II_Input_Array_Is_Sorted.md) - 兩數之和 2 (輸入有序數組)  \n[344. Reverse String](/problems/344.Reverse_String.md) - 反轉字串  \n[557. Reverse Words in a String III](/problems/557.Reverse_Words_in_a_String_III.md) - 反轉字串中的單字 3  \n[876. Middle of the Linked List](/problems/876.Middle_of_the_Linked_List.md) - 列表中間  \n[19. Remove Nth Node From End of List](/problems/19.Remove_Nth_Node_From_End_of_List.md) - 從列表末尾刪除第 n 個節點  \n[733. Flood Fill](/problems/733.Flood_Fill.md) - 洪水填充  \n[695. Max Area of Island](/problems/695.Max_Area_of_Island.md) - 島嶼最大面積  \n[617. Merge Two Binary Trees](/problems/617.Merge_Two_Binary_Trees.md) - 合併兩個二元樹  \n[46. Permutations](/problems/46.Permutations.md) - 排列  \n\n### Others\n[338. Counting Bits](/problems/338.Counting_Bits.md) - 計算Bit  \n[392. Is Subsequence](/problems/392.Is_Subsequence.md) - 子序列判斷  \n[799. Champagne Tower](/problems/799.Champagne_Tower.md) - 香檳塔  \n\n\n[1920. Build Array from Permutation](/problems/1920.Build_Array_from_Permutation.md) - 從排列構建數組  \n[1929. Concatenation of Array](/problems/1929.Concatenation_of_Array.md) - 數組串聯  \n[2011. Final Value of Variable After Performing Operations](/problems/2011.Final_Value_of_Variable_After_Performing_Operations.md) - 執行操作後變量的最終值  \n[1480. Running Sum of 1d Array](/problems/1480.Running_Sum_of_1d_Array.md) - 一維數組的運行總和  \n[2114. Maximum Number of Words Found in Sentences](/problems/2114.Maximum_Number_of_Words_Found_in_Sentences.md) - 在句子中找到的最大單字數  \n\n[1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](/problems/1689.Partitioning_Into_Minimum_Number_Of_Deci-Binary_Numbers.md) - 劃分成最小數量的十進制二進制數  \n[224. Basic Calculator](/problems/224.Basic_Calculator.md) - 基本計算器  \n\n\n### TypeScript  \n[2635. Apply Transform Over Each Element in Array](/problems/2635.Apply_Transform_Over_Each_Element_in_Array.md) - 對數組中的每個元素應用變換  \n[2666. Allow One Function Call](/problems/2666.Allow_One_Function_Call.md) - 允許一個函數調用  \n[1108. Defanging an IP Address](/problems/1108.Defanging_an_IP_Address.md) - 破壞 IP 地址  \n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhmes98318%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhmes98318%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhmes98318%2Fleetcode/lists"}