From 4fed2abb3001c46099ae799ffa0d66d46ae62665 Mon Sep 17 00:00:00 2001
From: Tsungyu Yu <42088295+ytyubox@users.noreply.github.com>
Date: Sun, 19 Feb 2023 10:14:43 +0800
Subject: [PATCH] Create 2023 0207 array and string.md

---
 .../2023 0207 array and string.md"            | 47 +++++++++++++++++++
 1 file changed, 47 insertions(+)
 create mode 100644 "\347\264\200\351\214\204/2023 0207 array and string.md"

diff --git "a/\347\264\200\351\214\204/2023 0207 array and string.md" "b/\347\264\200\351\214\204/2023 0207 array and string.md"
new file mode 100644
index 0000000..b72a01f
--- /dev/null
+++ "b/\347\264\200\351\214\204/2023 0207 array and string.md"	
@@ -0,0 +1,47 @@
+Y.J. Lee
+8:28 PM
+空格問清楚算不算
+counter從頭走到尾一遍 就知道答案了
+Y.J. Lee
+8:51 PM
+這題很多edge case
+最簡單應該是DP
+Y.J. Lee
+9:03 PM
+這個解法不錯https://leetcode.com/problems/one-edit-distance/discuss/238517/Python%3A-Simple-Clear-beats-100-time-and-memory
+莊惠文
+9:04 PM
+meta.title
+That topic does not exist.
+@@
+Y.J. Lee
+9:04 PM
+DP是通用解法
+莊惠文
+9:05 PM
+網址點進去
+Y.J. Lee
+9:05 PM
+QQ!
+Y.J. Lee
+9:07 PM
+72 edit distance (基本型)
+161 one edit distance (locked)
+Y.J. Lee
+9:08 PM
+class Solution(object):
+    def isOneEditDistance(self, s, t):
+        “”"
+        :type s: str
+        :type t: str
+        :rtype: bool
+        “”"
+        if s == t: return False
+        i = 0
+        while i < min(len(s),len(t)):
+            if s[i] == t[i]:
+                i += 1
+            else:
+                break
+        return s[i+1:] == t[i+1:] or s[i:] == t[i+1:] or s[i+1:]==t[i:]
+161