{"id":20673058,"url":"https://github.com/relph1119/classic-computer-science-problems-notes","last_synced_at":"2026-03-08T16:31:41.987Z","repository":{"id":106542597,"uuid":"604662226","full_name":"Relph1119/classic-computer-science-problems-notes","owner":"Relph1119","description":"《算法精粹-经典计算机科学问题Java实现》学习笔记","archived":false,"fork":false,"pushed_at":"2023-02-21T14:36:01.000Z","size":64,"stargazers_count":2,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-09-27T02:42:14.566Z","etag":null,"topics":["java"],"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/Relph1119.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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2023-02-21T14:32:28.000Z","updated_at":"2024-03-23T02:55:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"50da89c8-1045-4942-8cad-227c215dd05c","html_url":"https://github.com/Relph1119/classic-computer-science-problems-notes","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Relph1119/classic-computer-science-problems-notes","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Relph1119%2Fclassic-computer-science-problems-notes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Relph1119%2Fclassic-computer-science-problems-notes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Relph1119%2Fclassic-computer-science-problems-notes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Relph1119%2Fclassic-computer-science-problems-notes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Relph1119","download_url":"https://codeload.github.com/Relph1119/classic-computer-science-problems-notes/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Relph1119%2Fclassic-computer-science-problems-notes/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":278399608,"owners_count":25980329,"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","status":"online","status_checked_at":"2025-10-04T02:00:05.491Z","response_time":63,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["java"],"created_at":"2024-11-16T20:39:57.338Z","updated_at":"2025-10-05T01:39:36.563Z","avatar_url":"https://github.com/Relph1119.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 《算法精粹-经典计算机科学问题Java实现》学习笔记\n\n本书主要使用Java语言，讲述了如何编程解决经典的算法问题，首先通过几个小的问题介绍递归、迭代、备忘录模式等解法，之后开始介绍经典算法，包括搜索问题（DFS、BFS、二分搜索、A*搜索）、建立带约束的模板求解问题（回溯思想、八皇后问题、着色问题、字谜问题）、图算法、遗传算法、k均值聚类算法、神经网络模型、极小化极大搜索算法（井字棋、四子棋）、其他问题（背包问题、旅行商问题、笛卡尔积）。\n\n## 环境安装\n- Java版本：11.0.10\n- Maven版本：3.6.3\n\n## 学习总结\n1. 这本书通过Java语言编程求解代码，大量用了`stream`、泛型编程，其中还使用了访问者模式、备忘录模式等经典设计模式\n2. 书中的算法求解分析是逐步式的，通过经典问题，构建算法求解模板\n3. 应用了很多Java8的新特性，包括`stream`和`lambda`编程，还包括`Optional`、`Predicate`、`Function`、`DoubleSummaryStatistics`类方法；\n4. 本书包含各种有趣的示例，比如走迷宫、传教士和食人族问题、井字棋和四子棋AI的构建。\n5. 当然，本书的重点是各种算法，包括\n   - 搜索算法：DFS、BFS、二分搜索、A*搜索\n   - 约束满足问题的通解：CSP求解模板、回溯思想\n   - 图问题：构建最小生成树（Jarnik算法）、Dijkstra算法\n   - 遗传算法\n   - 机器学习和深度学习算法：KMeans算法、神经网络与梯度下降\n   - 极小化极大算法\n   - 动态规划（DP算法）、笛卡尔积构建","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frelph1119%2Fclassic-computer-science-problems-notes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frelph1119%2Fclassic-computer-science-problems-notes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frelph1119%2Fclassic-computer-science-problems-notes/lists"}