Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | ||||
| 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| 11 | 12 | 13 | 14 | 15 | 16 | 17 |
| 18 | 19 | 20 | 21 | 22 | 23 | 24 |
| 25 | 26 | 27 | 28 | 29 | 30 | 31 |
Tags
- node.js
- network
- dockerfile
- gns3
- RAID
- Docker Swarm
- 실습
- nodejs
- RAPA
- 네트워크
- 용어정리
- mysql
- 클라우드
- git
- PAT
- Docker-compose
- 도커
- docker
- MongoDB
- PaaS
- 명령어
- Javascript
- 개념
- kubernetes
- express
- worker
- IaaS
- OpenStack
- 이론
- 쿠버네티스
Archives
- Today
- Total
목록BFS (1)
융융이'Blog
단어 변환
counts = [] def solution(begin, target, words): answer = 0 visited = [0] * len(words) print(visited[0] == 0) if target in words: print("있음") find_array(begin, words, visited, 0, target) answer = print(min(counts)) else: return answer # if last_check(words, target): return answer def check(last, target): count = 0 for i in range(len(target)): if last[i] == target[i]: count += 1 if count == len(ta..
2022이전/알고리즘(하루에하나씩!)
2020. 9. 11. 01:25