Permutation Difference between Two Strings
You are given two strings s and t such that every character occurs at most once in s and t is a permutation of s.
The permutation difference between s and t is defined as the sum of the absolute difference between the index of the occurrence of each character in s and the index of the occurrence of the same character in t.
Return the permutation difference between s and t.
Example 1
Input
s = "abc", t = "bac"Output
2For
s = "abc" and t = "bac", the permutation difference is |0 - 1| + |1 - 0| + |2 - 2| = 2.Example 2
Input
s = "abcde", t = "edbac"Output
12The permutation difference between
s and t is equal to |0 - 3| + |1 - 2| + |2 - 4| + |3 - 1| + |4 - 0| = 12.Constraints
- 1 <= s.length <= 26
- Each character occurs at most once in
s. tis a permutation ofs.sconsists only of lowercase English letters.