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
- git
- 명령어
- kubernetes
- gns3
- MongoDB
- 용어정리
- express
- PaaS
- mysql
- 네트워크
- Javascript
- 실습
- Docker Swarm
- Docker-compose
- RAID
- OpenStack
- 클라우드
- node.js
- docker
- 쿠버네티스
- 이론
- nodejs
- PAT
- 도커
- worker
- network
- IaaS
- dockerfile
- RAPA
- 개념
Archives
- Today
- Total
목록DFS (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