{"id":28937597,"url":"https://github.com/chea-young/solve-algorithm","last_synced_at":"2026-03-17T21:03:46.097Z","repository":{"id":42182416,"uuid":"275753927","full_name":"chea-young/solve-algorithm","owner":"chea-young","description":"알고리즘 문제를 풀면서 문제와 해결과정을 적는 Repository","archived":false,"fork":false,"pushed_at":"2025-05-27T00:12:32.000Z","size":322,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-05-27T01:26:06.285Z","etag":null,"topics":["algorithm","java","python"],"latest_commit_sha":null,"homepage":"","language":"Python","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/chea-young.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":"2020-06-29T06:50:57.000Z","updated_at":"2025-05-27T00:12:36.000Z","dependencies_parsed_at":"2023-01-24T03:30:16.782Z","dependency_job_id":"b1a09608-9bee-490c-b161-25fc093c6405","html_url":"https://github.com/chea-young/solve-algorithm","commit_stats":null,"previous_names":["chea-young/solve-algorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/chea-young/solve-algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chea-young%2Fsolve-algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chea-young%2Fsolve-algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chea-young%2Fsolve-algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chea-young%2Fsolve-algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/chea-young","download_url":"https://codeload.github.com/chea-young/solve-algorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chea-young%2Fsolve-algorithm/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261373737,"owners_count":23148920,"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":["algorithm","java","python"],"created_at":"2025-06-22T21:37:46.964Z","updated_at":"2026-03-17T21:03:46.092Z","avatar_url":"https://github.com/chea-young.png","language":"Python","readme":"# solve_Algorithm\n\n## 알고리즘 Note\n- 최단 경로를 찾는 경우\n  - 음수 존재: 벨만포드\n    - 알고리즘 참고: https://github.com/chea-young/solve_Algorithm/blob/master/%EB%B0%B1%EC%A4%80/11657.java \n  - 음수 존재 X: 다익스트라\n\n## ./programmers\n\n- https://programmers.co.kr/\n\n### 순위 검색\n\n    1. info 정보를 split()를 사용하여 list를 만들고 info에 대한 dict을 만든다.\n    2. info 순서대로 number list에 넣고 해당 정보의 index를 추가하여 준다.\n        - 예를 들면 'java backend junior pizza 150'가 첫 번쨰로 나왔을 때 java, backen, junior, pizza를 key로 value에 0을 넣어준다\n    3. query 정보를 split()를 사용하여 query_info list를 만든다.\n    4. -가 아닌 것들에 대한 정보만을 모아 해당 value를 찾아 그 list들 끼리 교집합을 찾아준다.\n    5. 찾은 교집합 리스트에 수들이 quer_info[7]의 수보다 크거나 같으면 answer list에 추가하여 준다.\n\n### 메뉴 리뉴얼 -\u003e dict이 나을수도 -\u003e 여러가지 시도해보기\n\n    1. menu list와 order_people list를 만든다.\n    2. for문에 orders를 넣어 menu list에 단품메뉴가 없으면 추가하고 order_people에 사람 번호를 추가\n        - 혹은 단품메뉴에 있으면 menu list에서 해당 단품메뉴의 index를 찾아 order_people[index]에 사람 번호를 추가한다.\n    3. for문에 course를 돌아가게 하여 코스메뉴 갯수로 만들어질 수 있는 코스요리후보들을 모두 구한다.\n    4. 코스요리 후보들의 각 알파벳 마다의 menu list에 index를 구하여 oder_people에 해당하는 list를 찾고 교집합을 구한다.\n    5. 해당 코스요리 후보들에서 가장 인기가 많은 후보들을 answer에 추가한다.\n        -  만약에 가장 인기가 많은 후보가 1명일 경우 추가하지 않는다.\n\n### pytest\n\n    - pytest python파일 -s\n    =\u003e 자세한 정보를 볼 수 있다.\n\n### 참고하는 사이트 \u0026 책\n\n\n## C++\n\n- 실행\n- ```\n  g++ -o 5073 5073.cpp\n  PS C:\\Users\\user\\Documents\\00_cheayoung.lee\\100_etc\\solve_Algorithm\\백준\\c++\u003e ./5073\n  ```\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0498-diagonal-traverse](https://github.com/chea-young/solve-algorithm/tree/master/0498-diagonal-traverse) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/chea-young/solve-algorithm/tree/master/2244-number-of-laser-beams-in-a-bank) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/chea-young/solve-algorithm/tree/master/2324-find-triangular-sum-of-an-array) |\n| [3251-maximum-area-of-longest-diagonal-rectangle](https://github.com/chea-young/solve-algorithm/tree/master/3251-maximum-area-of-longest-diagonal-rectangle) |\n| [3790-fruits-into-baskets-ii](https://github.com/chea-young/solve-algorithm/tree/master/3790-fruits-into-baskets-ii) |\n## Binary Search\n|  |\n| ------- |\n| [3790-fruits-into-baskets-ii](https://github.com/chea-young/solve-algorithm/tree/master/3790-fruits-into-baskets-ii) |\n## Segment Tree\n|  |\n| ------- |\n| [3790-fruits-into-baskets-ii](https://github.com/chea-young/solve-algorithm/tree/master/3790-fruits-into-baskets-ii) |\n## Simulation\n|  |\n| ------- |\n| [0498-diagonal-traverse](https://github.com/chea-young/solve-algorithm/tree/master/0498-diagonal-traverse) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/chea-young/solve-algorithm/tree/master/2324-find-triangular-sum-of-an-array) |\n| [3790-fruits-into-baskets-ii](https://github.com/chea-young/solve-algorithm/tree/master/3790-fruits-into-baskets-ii) |\n## Ordered Set\n|  |\n| ------- |\n| [3790-fruits-into-baskets-ii](https://github.com/chea-young/solve-algorithm/tree/master/3790-fruits-into-baskets-ii) |\n## Matrix\n|  |\n| ------- |\n| [0498-diagonal-traverse](https://github.com/chea-young/solve-algorithm/tree/master/0498-diagonal-traverse) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/chea-young/solve-algorithm/tree/master/2244-number-of-laser-beams-in-a-bank) |\n## Math\n|  |\n| ------- |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/chea-young/solve-algorithm/tree/master/2244-number-of-laser-beams-in-a-bank) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/chea-young/solve-algorithm/tree/master/2324-find-triangular-sum-of-an-array) |\n## Combinatorics\n|  |\n| ------- |\n| [2324-find-triangular-sum-of-an-array](https://github.com/chea-young/solve-algorithm/tree/master/2324-find-triangular-sum-of-an-array) |\n## String\n|  |\n| ------- |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/chea-young/solve-algorithm/tree/master/2244-number-of-laser-beams-in-a-bank) |\n\u003c!---LeetCode Topics End--\u003e","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchea-young%2Fsolve-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchea-young%2Fsolve-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchea-young%2Fsolve-algorithm/lists"}