diff options
author | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
---|---|---|
committer | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
commit | 185ef9fcb0e59f13e9ee0ccb261693cdaddebab0 (patch) | |
tree | 3f19388b054fb2a12230706681dd62f077890c51 /works/solutions/leetcode/cpp/1347.cpp | |
parent | ca5a0f8dde5d8d9d7f877a790d05a270cc3224f9 (diff) | |
download | crupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.tar.gz crupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.tar.bz2 crupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.zip |
import(solutions): Move leetcode solutions to subdir.
Diffstat (limited to 'works/solutions/leetcode/cpp/1347.cpp')
-rw-r--r-- | works/solutions/leetcode/cpp/1347.cpp | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/works/solutions/leetcode/cpp/1347.cpp b/works/solutions/leetcode/cpp/1347.cpp new file mode 100644 index 0000000..154a6b5 --- /dev/null +++ b/works/solutions/leetcode/cpp/1347.cpp @@ -0,0 +1,35 @@ +#include <string>
+
+using std::string;
+
+class Solution
+{
+public:
+ int minSteps(string s, string t)
+ {
+ int s_count[26]{0};
+ int t_count[26]{0};
+
+ for (auto c : s)
+ {
+ s_count[c - 'a']++;
+ }
+
+ for (auto c : t)
+ {
+ t_count[c - 'a']++;
+ }
+
+ int result = 0;
+
+ for (int i = 0; i < 26; i++)
+ {
+ int a = s_count[i];
+ int b = t_count[i];
+ if (a > b)
+ result += a - b;
+ }
+
+ return result;
+ }
+};
\ No newline at end of file |