Within One Edit

You are given two strings s0 and s1 consisting of lowercase English letters.

An edit is one of the following:

• Deleting one character.
• Inserting one character.
• Replacing one character with a different character.

Return true if s0 can be turned into s1 using at most one edit, and false otherwise. Equal strings need zero edits, so they count as within one edit.

Examples

Example 1

Input: s0 = "abc", s1 = "adc"
Output: true
Explanation: Replacing 'b' with 'd' turns "abc" into "adc".

Example 2

Input: s0 = "abc", s1 = "abcd"
Output: true
Explanation: Inserting 'd' at the end turns "abc" into "abcd".

Example 3

Input: s0 = "abc", s1 = "axcd"
Output: false
Explanation: Turning "abc" into "axcd" needs at least two edits.