[LeetCode] 1347. Minimum Number of Steps to Make Two Strings Anagram 制造字母异位词的最小步骤数

You are given two strings of the same length `s` and `t`. In one step you can choose **any character** of `t` and replace it with **another character*
posted @ 2023-06-05 23:44  Grandyang  阅读(141)  评论(0编辑  收藏  举报
Fork me on GitHub