Given two strings, s and t, determine if they are one edit distance apart. An edit distance of one means that there exists exactly one operation required to transform s into t, where the operation can be:

Inserting exactly one character into s to obtain t.
Deleting exactly one character from s to obtain t.
Replacing exactly one character in s with a different character to obtain t.

Return true if the above conditions are met; otherwise, return false.

Example 1:

Input: s = "teacher", t = "leather"
Output: false
Explanation: We cannot get t from s by only one step,we need to replace 't' with 'l' anc replace 'c' with 't'.

Example 2:

Input: s = "D", t = "d"
Output: true
Explanation: We can replace ‘D’ with ‘d’.

Example 3:

Input: s = "moon", t = "mon"
Output: true
Explanation: We can delete ‘o’ .

Constraints:

0 <= s.length, t.length <= 10⁴
s and t consist of lowercase letters, uppercase letters, and digits.