백준 1919번: 애너그램 만들기

https://www.acmicpc.net/problem/1919

1. 문제

2. 알고리즘

키워드 - 문자열, 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    string s1, s2; cin >> s1 >> s2;
 
    char table_a[26], table_b[26];
    memset(table_a, 0, sizeof(table_a));
    memset(table_b, 0, sizeof(table_b));
 
    for (int i=0; i<s1.size(); i++) {
        char ch = s1[i];
        table_a[ch-'a']++;
    }
 
    for (int i=0; i<s2.size(); i++) {
        char ch = s2[i];
        table_b[ch-'a']++;
    }
 
    int sol = 0;
 
    for (int i=0; i<26; i++) {
        sol = sol + abs(table_a[i] - table_b[i]);
    }
 
    cout << sol << CENDL;
    return 0; 
}