https://www.4clojure.com/problem/101
| Difficulty: | Hard |
| Topics: | seqs |
Given two sequences x and y, calculate the Levenshtein distance of x and y, i. e. the minimum number of edits needed to transform x into y. The allowed edits are:
- insert a single item
- delete a single item
- replace a single item with another item
WARNING: Some of the test cases may timeout if you write an inefficient solution!
- insert a single item
- delete a single item
- replace a single item with another item
WARNING: Some of the test cases may timeout if you write an inefficient solution!
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ "kitten" "sitting") 3) |
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ "closure" "clojure") (__ "clojure" "closure") 1) |
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ "xyx" "xyyyx") 2) |
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ "" "123456") 6) |
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ "Clojure" "Clojure") (__ "" "") (__ [] []) 0) |
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ [1 2 3 4] [0 2 3 4 5]) 2) |
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ '(:a :b :c :d) '(:a :d)) 2) |
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ "ttttattttctg" "tcaaccctaccat") 10) |
![]() | <textarea wrap="off" autocorrect="off" autocapitalize="off" style=" absolute; padding-top: 0px; padding-left: 0px; width: 1px; height: 1em; outline: none !important;"></textarea> (= (__ "gaattctaatctc" "caaacaaaaaattt") 9) |
내 해답은 메모 테크닉 + 리커젼이었네 ㅋㅋ

clojure 냐? 이건 잘 모르는데
으흥~~ clojure 에서는 문자열도 걍 sequence 로 다루는군~
아무거로나 해서 답내도 됨
시퀀스에 속하는 것중 하나가 문자열임
응 문제보고 이해했음.
갤이 조용한거 보니 선수들이 다 여기 매달리고 있나 보군 ㅋㅋ
http://dblack.tk
커뮤니티 사이트 입니다 많은 이용 부탁 드립니다.