FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 3412,3  "name": "permutation-difference-between-two-strings",4  "difficulty": "Easy",5  "link": "https://leetcode.com/problems/permutation-difference-between-two-strings/",6  "date": "2024-05-05",7  "task_description": "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:** 2 **Explanation:** For `s = \"abc\"` and `t = \"bac\"`, the permutation difference of `s` and `t` is equal to the sum of: The absolute difference between the index of the occurrence of `\"a\"` in `s` and the index of the occurrence of `\"a\"` in `t`. The absolute difference between the index of the occurrence of `\"b\"` in `s` and the index of the occurrence of `\"b\"` in `t`. The absolute difference between the index of the occurrence of `\"c\"` in `s` and the index of the occurrence of `\"c\"` in `t`. That is, the permutation difference between `s` and `t` is equal to `|0 - 1| + |1 - 0| + |2 - 2| = 2`. **Example 2:** **Input:** s = \"abcde\", t = \"edbac\" **Output:** 12 **Explanation:** The 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`. `t` is a permutation of `s`. `s` consists only of lowercase English letters.",8  "test_case": [9    {10      "label": "Example 1",11      "input": "s = \"abc\", t = \"bac\"",12      "output": "2 "13    },14    {15      "label": "Example 2",16      "input": "s = \"abcde\", t = \"edbac\"",17      "output": "12 "18    }19  ],20  "constraints": [21    "The absolute difference between the index of the occurrence of \"a\" in s and the index of the occurrence of \"a\" in t.",22    "The absolute difference between the index of the occurrence of \"b\" in s and the index of the occurrence of \"b\" in t.",23    "The absolute difference between the index of the occurrence of \"c\" in s and the index of the occurrence of \"c\" in t.",24    "1 <= s.length <= 26",25    "Each character occurs at most once in s.",26    "t is a permutation of s.",27    "s consists only of lowercase English letters."28  ],29  "python_template": "class Solution(object):\n    def findPermutationDifference(self, s, t):\n        \"\"\"\n        :type s: str\n        :type t: str\n        :rtype: int\n        \"\"\"\n        ",30  "java_template": "class Solution {\n    public int findPermutationDifference(String s, String t) {\n        \n    }\n}",31  "metadata": {32    "func_name": "findPermutationDifference"33  }34}