leetcode

0 class Solution {

1 public:

2 int findPermutationDifference(const string &s, const string &t) const {

3 static int pos[26];

4 int res = 0;

5

6 for (int i = 0; i < size(s); i++) {

7 pos[s[i] - 'a'] = i;

8 }

9

10 for (int i = 0; i < size(t); i++) {

11 res += abs(pos[t[i] - 'a'] - i);

12 }

13

14 return res;

15 }

16 };