{"id":18914711,"url":"https://github.com/lau1944/leetcode-note","last_synced_at":"2026-05-05T03:39:38.323Z","repository":{"id":54479169,"uuid":"522409435","full_name":"lau1944/leetcode-note","owner":"lau1944","description":"A leetcode algorithm practice note ","archived":false,"fork":false,"pushed_at":"2023-08-21T15:36:27.000Z","size":17,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-12-31T14:43:19.997Z","etag":null,"topics":["algorithum","dynamic-programming","java","javascript","leetcode","recursion","tree"],"latest_commit_sha":null,"homepage":"","language":"Java","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/lau1944.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-08-08T04:53:45.000Z","updated_at":"2022-08-12T10:14:54.000Z","dependencies_parsed_at":"2024-11-08T10:13:03.827Z","dependency_job_id":"175c6465-6b95-4138-9538-94578df41114","html_url":"https://github.com/lau1944/leetcode-note","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/lau1944%2Fleetcode-note","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lau1944%2Fleetcode-note/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lau1944%2Fleetcode-note/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lau1944%2Fleetcode-note/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lau1944","download_url":"https://codeload.github.com/lau1944/leetcode-note/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239907249,"owners_count":19716585,"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":["algorithum","dynamic-programming","java","javascript","leetcode","recursion","tree"],"created_at":"2024-11-08T10:12:31.812Z","updated_at":"2026-03-09T23:30:20.316Z","avatar_url":"https://github.com/lau1944.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"## 个人的Leetcode刷题笔记\n\n## 暴力搜索算法\n\n### 链表题\n\n一般使用双指针解法\n\n[86 - partition list](./partition_list_86)\n\n\n\n### 二叉树\n\n1、是否可以通过遍历一遍二叉树得到答案？如果可以，用一个 traverse 函数配合外部变量来实现。\n\n2、是否可以定义一个递归函数，通过子问题（子树）的答案推导出原问题的答案？如果可以，写出这个递归函数的定义，并充分利用这个函数的返回值。\n\n3、无论使用哪一种思维模式，你都要明白二叉树的每一个节点需要做什么，需要在什么时候（前中后序）做。\n\n（解题无非是遍历或者分解)\n\n套路:\n需要使用子树信息时使用后序遍历, 并且规划好返回值\n\n[669 - trim a binary tree](./trim_a_binary_search_tree_669)\n\u003cbr /\u003e\n[124 - binary tree max path sum](./bt_max_path_sum_124)\n\u003cbr /\u003e\n[543 - diameter in binary search tree](./diameter_bst_543)\n\u003cbr /\u003e\n[669 - trim a binary search tree](./trim_a_binary_search_tree_669)\n\n\n### BFS\n\n[752 - open the lock](./open_the_lock_752)\n\u003cbr /\u003e\n[773 - sliding puzzle](./sliding_puzzle_773)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flau1944%2Fleetcode-note","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flau1944%2Fleetcode-note","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flau1944%2Fleetcode-note/lists"}