문제
Given two equal-size strings s and t. In one step you can choose any character of t and replace it with another character.
Return the minimum number of steps to make t an anagram of s.
An Anagram of a string is a string that contains the same characters with a different (or the same) ordering.
제한사항
- 1 <= s.length <= 50000
- s.length == t.length
- s and t contain lower-case English letters only.
입출력 예
1
2
3
4
| Example 1:
Input: s = "bab", t = "aba"
Output: 1
Explanation: Replace the first 'a' in t with b, t = "bba" which is anagram of s.
|
1
2
3
4
| Example 2:
Input: s = "leetcode", t = "practice"
Output: 5
Explanation: Replace 'p', 'r', 'a', 'i' and 'c' from t with proper characters to make t anagram of s.
|
1
2
3
4
| Example 3:
Input: s = "anagram", t = "mangaar"
Output: 0
Explanation: "anagram" and "mangaar" are anagrams.
|
1
2
3
| Example 4:
Input: s = "xxyyzz", t = "xxyyzz"
Output: 0
|
1
2
3
| Example 5:
Input: s = "friend", t = "family"
Output: 4
|
풀이
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
| class Solution {
public:
int minSteps(string s, string t) {
int ans = 0;
map<char, int> m;
// 각각 문자 및 반복횟수를 map으로 구성
for(auto& i : s)
++m[i];
for(auto& i : t){
// 현재 문자가 map에 저장되어 있다면 -1 하여 문자의 수를 맞춤
if(m[i] > 0){
--m[i];
}
// 현재 문자가 map에 없다면 바꿔야할 문자
else{
++ans;
}
}
return ans;
}
};
|
