{"id":19924846,"url":"https://github.com/willard-yuan/cpp-code-training","last_synced_at":"2026-06-11T15:31:30.398Z","repository":{"id":31304338,"uuid":"34866600","full_name":"willard-yuan/cpp-code-training","owner":"willard-yuan","description":"coding","archived":false,"fork":false,"pushed_at":"2021-11-06T15:45:13.000Z","size":14933,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-12T00:26:40.836Z","etag":null,"topics":["cpp"],"latest_commit_sha":null,"homepage":"","language":"HTML","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/willard-yuan.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}},"created_at":"2015-04-30T17:10:18.000Z","updated_at":"2023-03-08T22:13:06.000Z","dependencies_parsed_at":"2022-08-27T09:22:30.896Z","dependency_job_id":null,"html_url":"https://github.com/willard-yuan/cpp-code-training","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/willard-yuan%2Fcpp-code-training","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willard-yuan%2Fcpp-code-training/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willard-yuan%2Fcpp-code-training/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willard-yuan%2Fcpp-code-training/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/willard-yuan","download_url":"https://codeload.github.com/willard-yuan/cpp-code-training/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241352134,"owners_count":19948787,"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":["cpp"],"created_at":"2024-11-12T22:19:16.022Z","updated_at":"2026-06-11T15:31:30.382Z","avatar_url":"https://github.com/willard-yuan.png","language":"HTML","funding_links":[],"categories":[],"sub_categories":[],"readme":"## 代码清单\n\n1.问题描述： 计算阶乘结果有多少个0\n\n1). 暴力解法。直接计算阶乘结果，然后统计0的个数，这种暴力解法在计算阶乘的结果极易溢出。\n2). 统计因子法。统计阶乘中每个数公因子5有多少个。\n代码详见[countFactorialZeros.cpp](https://github.com/willard-yuan/coding-training/blob/master/coding-interviews/countFactorialZeros.cpp)\n\n2.问题描述：char *commonStrFind(const char *str, const char *substr)，找出str2字符串在str1字符串中第一次出现的位置，返回这个位置的指针\n代码[commonStrFind.cpp](https://github.com/willard-yuan/coding-training/blob/master/coding-freely/commonStrFind.cpp)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwillard-yuan%2Fcpp-code-training","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwillard-yuan%2Fcpp-code-training","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwillard-yuan%2Fcpp-code-training/lists"}