[Algorithms] 스택,큐,해쉬,힙-아나그램(해쉬)

 

• 1. 딕셔너리를 이용하는 방법 
  • 참고자료 - https://datascienceschool.net/01%20python/02.11%20%ED%8C%8C%EC%9D%B4%EC%8D%AC%EC%97%90%EC%84%9C%20%EB%94%95%EC%85%94%EB%84%88%EB%A6%AC%20%EC%9E%90%EB%A3%8C%ED%98%95%20%EB%8B%A4%EB%A3%A8%EA%B8%B0.html

import sys
 
# sys.stdin = open("input", "rt")
str1=input()
dict1=dict()
str2=input()
 
for ch in str1:
    dict1[ch] = dict1.get(ch, 0) + 1
 
for ch in str2:
    dict1[ch] = dict1.get(ch, 0) - 1
 
for val in dict1.values():
    if val>0:
        print("NO")
        break
else:
    print("YES")
 

import sys
 
# sys.stdin = open("input", "rt")
str1=input()
str2=input()
 
arr1=[0]*52 # 알파벳은 대문자+소문자 = 52개
arr2=[0]*52
 
for a in str1:
    if a.isupper():
        arr1[ord(a)-65]+=1
    else:
        arr1[ord(a)-71]+=1
for a in str2:
    if a.isupper():
        arr2[ord(a)-65]+=1
    else:
        arr2[ord(a)-71]+=1
for i in range(52):
    if arr1[i]!=arr2[i]:
        print("NO")
        break
else:
    print("YES")