← 返回 jpmorgan 的题目列表Minimum Steps to Anagram
类型：online_judge
Given two strings s and t which only contain lowercase English letters. Calculate the minimum number of steps to make s an anagram of t. In each step, you can replace any character in s.
Example
Input: s = "aba", t = "bab"
Output: 1
Constraints
1 <= s.length, t.length <= 10^5
s and t are of the same length
Both s and t consist of lowercase English letters
Example
Input
aba
bab