https://log.j2234.cc/tags/string/Recent content in String on j2234's logHugo -- gohugo.ioen© 2026Thu, 12 Mar 2026 16:01:17 +0000https://log.j2234.cc/posts/velog/010-%EB%A0%88%EB%B2%A4%EC%8A%88%ED%83%80%EC%9D%B8-%EA%B1%B0%EB%A6%AC/Tue, 05 Nov 2024 11:14:05 +0000https://log.j2234.cc/posts/velog/010-%EB%A0%88%EB%B2%A4%EC%8A%88%ED%83%80%EC%9D%B8-%EA%B1%B0%EB%A6%AC/<h2 class="relative group">Levenshtein distance? <div id="levenshtein-distance" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#levenshtein-distance" aria-label="Anchor">#</a> </span> </h2> <p>문자열 비교 알고리즘으로, 문자열 a,b가 있을 때 a를b로 만드는데 드는 비용을 동적 계획법으로 구하는 알고리즘 문자열의 유사성을 판단하는데 쓰인다.</p> <h2 class="relative group">기본 풀이 <div id="기본-풀이" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%ea%b8%b0%eb%b3%b8-%ed%92%80%ec%9d%b4" aria-label="Anchor">#</a> </span> </h2> <p>dp[i][j] = 문자열 a의 [i]까지 고려했을때, 문자열 b의[j]를 만들 수 있는 최소 변환 수</p> <blockquote><ol> <li>문자열은 빈 문자열 <code>''</code>부터 시작한다. 빈 문자열은 다른 문자열의 길이만큼 특정 문자를 추가해야 같아지므로 각각 인덱스값을 가지게 된다.</li> </ol> </blockquote><figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="auto" alt="" width="401" height="297" src="https://log.j2234.cc/posts/velog/010-%EB%A0%88%EB%B2%A4%EC%8A%88%ED%83%80%EC%9D%B8-%EA%B1%B0%EB%A6%AC/img/image-01.webp" srcset="https://log.j2234.cc/posts/velog/010-%EB%A0%88%EB%B2%A4%EC%8A%88%ED%83%80%EC%9D%B8-%EA%B1%B0%EB%A6%AC/img/image-01.webp 800w, https://log.j2234.cc/posts/velog/010-%EB%A0%88%EB%B2%A4%EC%8A%88%ED%83%80%EC%9D%B8-%EA%B1%B0%EB%A6%AC/img/image-01.webp 1280w" sizes="(min-width: 768px) 50vw, 65vw" data-zoom-src="https://log.j2234.cc/posts/velog/010-%EB%A0%88%EB%B2%A4%EC%8A%88%ED%83%80%EC%9D%B8-%EA%B1%B0%EB%A6%AC/img/image-01.webp"></figure> <blockquote><p>dp[1][1]은 세 가지 중 하나로 만들어지는데</p>