{"id":22531955,"url":"https://github.com/yue1123/study-every-day","last_synced_at":"2026-04-30T16:34:13.029Z","repository":{"id":37639084,"uuid":"473008173","full_name":"yue1123/study-every-day","owner":"yue1123","description":"前端学习笔记,每天进步一点点","archived":false,"fork":false,"pushed_at":"2023-09-02T09:09:20.000Z","size":240,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-06-22T10:41:57.838Z","etag":null,"topics":["javascript","leetcode","typescript"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/yue1123.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,"zenodo":null}},"created_at":"2022-03-23T02:21:59.000Z","updated_at":"2023-01-09T21:19:13.000Z","dependencies_parsed_at":"2025-06-22T10:37:44.671Z","dependency_job_id":"d2c59513-5c51-4b07-bb27-4b308d96f13f","html_url":"https://github.com/yue1123/study-every-day","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/yue1123/study-every-day","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yue1123%2Fstudy-every-day","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yue1123%2Fstudy-every-day/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yue1123%2Fstudy-every-day/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yue1123%2Fstudy-every-day/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yue1123","download_url":"https://codeload.github.com/yue1123/study-every-day/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yue1123%2Fstudy-every-day/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32470879,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-30T13:12:12.517Z","status":"ssl_error","status_checked_at":"2026-04-30T13:12:06.837Z","response_time":57,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["javascript","leetcode","typescript"],"created_at":"2024-12-07T08:09:18.391Z","updated_at":"2026-04-30T16:34:13.013Z","avatar_url":"https://github.com/yue1123.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"## 学习代码记录\n每天进步一点点,保持github常绿🍏\n\n- [DataStructuresAlgorithms ](./src/DataStructuresAlgorithms)\n  - [LinkedList ](./src/DataStructuresAlgorithms/LinkedList)\n  - [List  列表](./src/DataStructuresAlgorithms/List)\n  - [Stack ](./src/DataStructuresAlgorithms/Stack)\n  - [TreeNode ](./src/DataStructuresAlgorithms/TreeNode)\n- [DesignPatterns ](./src/DesignPatterns)\n  - [Subject ](./src/DesignPatterns/Subject)\n  - [pubsub  发布订阅模式](./src/DesignPatterns/pubsub)\n- [手写 ECMAscript 方法](./src/ECMAscript)\n  - [MyPromise  术语](./src/ECMAscript/MyPromise)\n  - [string ](./src/ECMAscript/string)\n- [MaximumConcurrent  js 实现最大并发数控制](./src/MaximumConcurrent)\n- [Promise  Promise 八股文](./src/Promise)\n- [Typescript](./src/Typescript)\n- [angular 参数注入实现](./src/angularParamsInject)\n- [css ](./src/css)\n  - [text-animation  纯 css 实现的文字特效](./src/css/text-animation)\n- [debuounce  手写防抖](./src/debuounce)\n  - [test.html ](./src/debuounce/test.html)\n- [leetCode 每日算法题](./src/leetcode)\n  - [addBinary  二进制字符串求和](./src/leetcode/addBinary)\n  - [addStrings  两字符串相加](./src/leetcode/addStrings)\n  - [bracketsMaxDepth  括号的最大嵌套深度](./src/leetcode/bracketsMaxDepth)\n  - [climbStairs  爬楼梯](./src/leetcode/climbStairs)\n  - [deleteDuplicates  删除排序链表中的重复元素](./src/leetcode/deleteDuplicates)\n  - [deleteNode  删除链表中的节点](./src/leetcode/deleteNode)\n  - [firstUniqChar  字符串中的第一个唯一字符](./src/leetcode/firstUniqChar)\n  - [hasCycle  环形链表](./src/leetcode/hasCycle)\n  - [inorderTraversal  二叉树的中序遍历](./src/leetcode/inorderTraversal)\n  - [intersect  两个数组的交集 II](./src/leetcode/intersect)\n  - [isAnagram  有效的字母异位词](./src/leetcode/isAnagram)\n  - [isBlance  平衡二叉树](./src/leetcode/isBlance)\n  - [isPalindrome  验证回文串](./src/leetcode/isPalindrome)\n  - [isPalindromeList  回文链表](./src/leetcode/isPalindromeList)\n  - [isPalindromeNumber  回文数](./src/leetcode/isPalindromeNumber)\n  - [isSameTree  相同的树](./src/leetcode/isSameTree)\n  - [isSymmetric  对称二叉树](./src/leetcode/isSymmetric)\n  - [isValidBST  验证二叉搜索树](./src/leetcode/isValidBST)\n  - [isValidBrackets  有效的括号](./src/leetcode/isValidBrackets)\n  - [isValidSudoku  有效的数独](./src/leetcode/isValidSudoku)\n  - [lengthOfLastWord  最后一个单词的长度](./src/leetcode/lengthOfLastWord)\n  - [levelOrder  二叉树的层序遍历](./src/leetcode/levelOrder)\n  - [longestCommonPrefix  最长公共前缀](./src/leetcode/longestCommonPrefix)\n  - [majorityElement  多数元素](./src/leetcode/majorityElement)\n  - [maxDepth  二叉树的最大深度](./src/leetcode/maxDepth)\n  - [maxSubArray  最大子数组和](./src/leetcode/maxSubArray)\n  - [mergeTwoArray  合并两个有序数组](./src/leetcode/mergeTwoArray)\n  - [mergeTwoLists  合并两个有序链表](./src/leetcode/mergeTwoLists)\n  - [minDepth  二叉树的最小深度](./src/leetcode/minDepth)\n  - [moveZeroes  移动零](./src/leetcode/moveZeroes)\n  - [plusOne  加一](./src/leetcode/plusOne)\n  - [preorderTraversal  二叉树的前序遍历](./src/leetcode/preorderTraversal)\n  - [removeNthFromEnd  删除链表的倒数第 N 个节点](./src/leetcode/removeNthFromEnd)\n  - [reverseList  反转链表](./src/leetcode/reverseList)\n  - [reverseNumber  整数反转](./src/leetcode/reverseNumber)\n  - [reverseString  反转字符串](./src/leetcode/reverseString)\n  - [rotate  旋转图像](./src/leetcode/rotate)\n  - [searchInsert  搜索插入位置](./src/leetcode/searchInsert)\n  - [sortedArrayToBST  将有序数组转换为二叉搜索树](./src/leetcode/sortedArrayToBST)\n  - [strStr  实现 strStr()](./src/leetcode/strStr)\n  - [twoSum  两数之和](./src/leetcode/twoSum)\n- [post  文章](./src/post)\n- [templateParse  vue模版字符串解析算法](./src/templateParse)\n- [throttle  节流实现](./src/throttle)\n  - [test.html ](./src/throttle/test.html)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyue1123%2Fstudy-every-day","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyue1123%2Fstudy-every-day","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyue1123%2Fstudy-every-day/lists"}