Title: [정봉찬] 9-4. 미로탐색 by devwqc · Pull Request #217 · fraudgroup/codingtest · GitHub
Open Graph Title: [정봉찬] 9-4. 미로탐색 by devwqc · Pull Request #217 · fraudgroup/codingtest
X Title: [정봉찬] 9-4. 미로탐색 by devwqc · Pull Request #217 · fraudgroup/codingtest
Description: 📝코딩테스트 정복. Contribute to fraudgroup/codingtest development by creating an account on GitHub.
Open Graph Description: ✔ 문제 제목: 미로탐색 ✔ 문제 유형: DFS ✔ 문제 풀이 날짜: 2024-09-07 💡 문제 분석 요약 7*7 격자판 미로를 탈출하는 경로의 가지수를 출력한다. 출발점은 (1, 1) 좌표, 도착점은 (7, 7) 좌표. 격자판의 1은 벽, 0은 통로. 상하좌우로만 움직인다. 💡 알고리즘 설계 격자판의 각 좌표를 노드로 계산해보자. 7*7 이므...
X Description: ✔ 문제 제목: 미로탐색 ✔ 문제 유형: DFS ✔ 문제 풀이 날짜: 2024-09-07 💡 문제 분석 요약 7*7 격자판 미로를 탈출하는 경로의 가지수를 출력한다. 출발점은 (1, 1) 좌표, 도착점은 (7, 7) 좌표. 격자판의 1은 벽, 0은 통로. 상하좌우로만 움직인다. 💡 알고리즘 설계 격자판의 각 좌표를 노드로 계산해보자. 7*7 이므...
Opengraph URL: https://github.com/fraudgroup/codingtest/pull/217
X: @github
Domain: patch-diff.githubusercontent.com
| route-pattern | /_view_fragments/voltron/pull_requests/show/:user_id/:repository/:id/pull_request_layout(.:format) |
| route-controller | voltron_pull_requests_fragments |
| route-action | pull_request_layout |
| fetch-nonce | v2:8fca4511-cfc1-9fc9-ac5a-b545ad3a6ea4 |
| current-catalog-service-hash | ae870bc5e265a340912cde392f23dad3671a0a881730ffdadd82f2f57d81641b |
| request-id | CF90:D536F:5F507F:7D0B79:698FB114 |
| html-safe-nonce | 420468a8508c5ea8c972cb6dac9ebc98b1e6b71e52503851bb9aa8cad7b3cc7b |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDRjkwOkQ1MzZGOjVGNTA3Rjo3RDBCNzk6Njk4RkIxMTQiLCJ2aXNpdG9yX2lkIjoiODA1MDAwMDE1ODkwODE5OTE4OCIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 |
| visitor-hmac | 885b456e3397ad86e666676a2c1d61860ac61766671fdc95e1bed857b56e0590 |
| hovercard-subject-tag | pull_request:2059002735 |
| github-keyboard-shortcuts | repository,pull-request-list,pull-request-conversation,pull-request-files-changed,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/voltron/pull_requests/show/fraudgroup/codingtest/217/pull_request_layout |
| twitter:image | https://opengraph.githubassets.com/72fc640774f9ac75a826283666e82e202bf6119fe352e7ef888a6ffb87db1ee0/fraudgroup/codingtest/pull/217 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/72fc640774f9ac75a826283666e82e202bf6119fe352e7ef888a6ffb87db1ee0/fraudgroup/codingtest/pull/217 |
| og:image:alt | ✔ 문제 제목: 미로탐색 ✔ 문제 유형: DFS ✔ 문제 풀이 날짜: 2024-09-07 💡 문제 분석 요약 7*7 격자판 미로를 탈출하는 경로의 가지수를 출력한다. 출발점은 (1, 1) 좌표, 도착점은 (7, 7) 좌표. 격자판의 1은 벽, 0은 통로. 상하좌우로만 움직인다. 💡 알고리즘 설계 격자판의 각 좌표를 노드로 계산해보자. 7*7 이므... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | devwqc |
| hostname | github.com |
| expected-hostname | github.com |
| None | 6df359c0989bb4eb7656e0047ab7a57a6657880db88f5a202f4e51ddbc3dfce8 |
| turbo-cache-control | no-cache |
| go-import | github.com/fraudgroup/codingtest git https://github.com/fraudgroup/codingtest.git |
| octolytics-dimension-user_id | 174826869 |
| octolytics-dimension-user_login | fraudgroup |
| octolytics-dimension-repository_id | 825536399 |
| octolytics-dimension-repository_nwo | fraudgroup/codingtest |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 825536399 |
| octolytics-dimension-repository_network_root_nwo | fraudgroup/codingtest |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | d09a7639fca70dcd33f2b127cabd422a73b10aef |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width