dev/democards/problems/problems/583.delete-operation-for-two-strings.ipynb

{
 "cells": [
  {
   "cell_type": "markdown",
   "source": [
    "Given two words _word1_ and _word2_ , find the minimum number of steps\n",
    "required to make _word1_ and _word2_ the same, where in each step you can\n",
    "delete one character in either string.\n",
    "\n",
    "**Example 1:**\n",
    "\n",
    "\n",
    "\n",
    "    Input: \"sea\", \"eat\"\n",
    "    Output: 2\n",
    "    Explanation: You need one step to make \"sea\" to \"ea\" and another step to make \"eat\" to \"ea\".\n",
    "\n",
    "\n",
    "**Note:**\n",
    "\n",
    "  1. The length of given words won't exceed 500.\n",
    "  2. Characters in given words can only be lower-case letters."
   ],
   "metadata": {}
  },
  {
   "outputs": [
    {
     "output_type": "execute_result",
     "data": {
      "text/plain": "min_distance583 (generic function with 1 method)"
     },
     "metadata": {},
     "execution_count": 1
    }
   ],
   "cell_type": "code",
   "source": [
    "# @lc code=start\n",
    "using LeetCode\n",
    "\n",
    "min_distance583(word1::String, word2::String) =\n",
    "    length(word2) + length(word2) - 2longest_common_subsequence(word1, word2)\n",
    "# @lc code=end"
   ],
   "metadata": {},
   "execution_count": 1
  },
  {
   "cell_type": "markdown",
   "source": [
    "---\n",
    "\n",
    "*This notebook was generated using [Literate.jl](https://github.com/fredrikekre/Literate.jl).*"
   ],
   "metadata": {}
  }
 ],
 "nbformat_minor": 3,
 "metadata": {
  "language_info": {
   "file_extension": ".jl",
   "mimetype": "application/julia",
   "name": "julia",
   "version": "1.10.1"
  },
  "kernelspec": {
   "name": "julia-1.10",
   "display_name": "Julia 1.10.1",
   "language": "julia"
  }
 },
 "nbformat": 4
}