๐Ÿ–ฅ๏ธSW Engineer/Algorithm

[๋ฐฑ์ค€]1181-๋‹จ์–ด ์ •๋ ฌ

์•ž๋™๋„คJIHOON 2023. 1. 5. 11:23

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

 

1181๋ฒˆ: ๋‹จ์–ด ์ •๋ ฌ

์ฒซ์งธ ์ค„์— ๋‹จ์–ด์˜ ๊ฐœ์ˆ˜ N์ด ์ฃผ์–ด์ง„๋‹ค. (1 ≤ N ≤ 20,000) ๋‘˜์งธ ์ค„๋ถ€ํ„ฐ N๊ฐœ์˜ ์ค„์— ๊ฑธ์ณ ์•ŒํŒŒ๋ฒณ ์†Œ๋ฌธ์ž๋กœ ์ด๋ฃจ์–ด์ง„ ๋‹จ์–ด๊ฐ€ ํ•œ ์ค„์— ํ•˜๋‚˜์”ฉ ์ฃผ์–ด์ง„๋‹ค. ์ฃผ์–ด์ง€๋Š” ๋ฌธ์ž์—ด์˜ ๊ธธ์ด๋Š” 50์„ ๋„˜์ง€ ์•Š๋Š”๋‹ค.

www.acmicpc.net

num = int(input())

words = []

for i in range(num):
    words.append(input())

words=list(set(words))
words.sort()
words.sort(key=len)

for i in words:
    print(i)

# sortํ•จ์ˆ˜


List.sort(key = , reverse = ,)

sort๋Š” ๋ฆฌ์ŠคํŠธํ˜• ํ•จ์ˆ˜๋กœ ์›๋ณธ ๋ฆฌ์ŠคํŠธ๋ฅผ ์ •๋ ฌํ•˜์—ฌ ๋ฐ˜ํ™˜ํ•œ๋‹ค. ๊ทธ๋ฆฌ๊ณ , key๋ฅผ ํ†ตํ•ด ์ •๋ ฌ ๊ธฐ์ค€์„ ์„ค์ •ํ•˜๊ณ , ์˜ค๋ฆ„์ฐจ์ˆœ์ธ์ง€ ๋‚ด๋ฆผ์ฐจ์ˆœ์ธ์ง€๋„ ๊ฒฐ์ •ํ•  ์ˆ˜ ์žˆ๋‹ค.

sorted([3,5,4,2,1])
# [1,2,3,4,5]

sorted({3,4,5,2,1})
# [1,2,3,4,5]

sorted๋ผ๋Š” ๋‚ด์žฅํ•จ์ˆ˜๋Š” ์›๋ณธ์€ ๊ฑด๋“œ๋ฆฌ์ง€ ์•Š๊ณ , ์ •๋ ฌ๋œ ๋ฆฌ์ŠคํŠธ๋ฅผ ๋ฐ˜ํ™˜์‹œ์ผœ ์ค€๋‹ค. ๋‚ด์žฅ ํ•จ์ˆ˜๋กœ์จ ์ž๋ฃŒํ˜•์— ๊ด€๊ณ„์—†์ด ์ •๋ ฌํ•˜์—ฌ ๋ฆฌ์ŠคํŠธ๋กœ ๋ฐ˜ํ™˜์‹œ์ผœ์ค€๋‹ค.


# ์ค‘๋ณต ์ œ๊ฑฐํ•˜๊ธฐ


1์ฐจ์› ๋ฆฌ์ŠคํŠธ์˜ ๊ฒฝ์šฐ

set(์ง‘ํ•ฉ ์ž๋ฃŒํ˜•)ํ•จ์ˆ˜๋ฅผ ํ†ตํ•ด ์ค‘๋ณต์„ ์ œ๊ฑฐํ•œ๋‹ค

๋‹ค์ฐจ์› ๋ฆฌ์ŠคํŠธ์˜ ๊ฒฝ์šฐ

for item in list if item not in list and not list.append(item)