ํ‹ฐ์Šคํ† ๋ฆฌ

์•ž๋™๋„คJIHOON
{RepoJI}
์•ž๋™๋„คJIHOON
์ „์ฒด ๋ฐฉ๋ฌธ์ž
์˜ค๋Š˜
์–ด์ œ
  • ๋ถ„๋ฅ˜ ์ „์ฒด๋ณด๊ธฐ (37)
    • ๐Ÿ–ฅ๏ธSW Engineer (29)
      • DataBase (0)
      • System Programming (0)
      • Algorithm (12)
      • DataStructure (0)
      • Computer Architechure (0)
      • Operating System (0)
      • Distributed System (11)
    • ๐ŸฆBackend (0)
      • Web (0)
    • ๐Ÿ—‚๏ธData Science (7)
      • Statistic (1)
      • Aritificial Intelli (5)
      • Probability Theory (0)
      • Information Retrieval (0)
      • Linear Algebra (0)
    • ๐ŸซUnderGraduate (1)

๋ธ”๋กœ๊ทธ ๋ฉ”๋‰ด

  • ํ™ˆ
  • ๐Ÿ—‚๏ธGithub

ํƒœ๊ทธ

  • association rule
  • Shemaphore
  • ์„ธ๋งˆํฌ์–ด
  • ๋‹จ์–ด ์ •๋ ฌ
  • ๋ฐ์ดํ„ฐ ์ฒญ๋…„ ์บ ํผ์Šค
  • ์ฃผ์„ฑ๋ถ„๋ถ„์„
  • q-learning algorithm
  • ๋ฐ์ดํ„ฐ๋ฒ ์ด์Šค์‹œ์Šคํ…œ Chap13
  • mini shell project
  • ๊ณต๋ถ„์‚ฐ
  • ์Šค๋ ˆ๋“œ
  • ๋ฐ์ดํ„ฐ๋ฒ ์ด์Šค์‹œ์Šคํ…œ Chap12
  • PCA
  • ์†Œ์ผ“
  • ํŒจํ„ด๋ถ„์„
  • Apriori algorithm
  • Q-learning
  • ์—ฐ๊ด€์„ฑ๋ถ„์„
  • pthread
  • Value function
  • ์ƒ๋ช…๋Œ€ ๋น„์ฆˆ๋‹ˆ์Šค ๊ณผ์ •
  • Pipe
  • ๊ฐ•ํ™”ํ•™์Šต
  • ๋ฉ”์„ธ์ง€ ํ
  • ๋ ˆ์ฝ”๋“œ ๋ฝํ‚น
  • Message Queue
  • ๊ณต์œ ๋ฉ”๋ชจ๋ฆฌ
  • ๋ฐ์ฒญ์บ 
  • shared memory
  • ํŒŒ์ผ ์‹œ์Šคํ…œ
hELLO ยท Designed By ์ •์ƒ์šฐ.
์•ž๋™๋„คJIHOON

{RepoJI}

๐Ÿ–ฅ๏ธSW Engineer/Algorithm

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

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)
์ €์ž‘์žํ‘œ์‹œ (์ƒˆ์ฐฝ์—ด๋ฆผ)

'๐Ÿ–ฅ๏ธSW Engineer > Algorithm' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€

[๋ฐฑ์ค€]11866-์š”์„ธํ‘ธ์Šค ๋ฌธ์ œ  (0) 2023.01.18
[๋ฐฑ์ค€]1966-ํ”„๋ฆฐํ„ฐ ํ  (0) 2023.01.17
[๋ฐฑ์ค€]2609-์ตœ๋Œ€๊ณต์•ฝ์ˆ˜์™€ ์ตœ์†Œ๊ณต๋ฐฐ์ˆ˜ ๊ตฌํ•˜๊ธฐ  (0) 2023.01.09
[๋ฐฑ์ค€]11651-์ขŒํ‘œ ์ •๋ ฌํ•˜๊ธฐ2  (0) 2023.01.07
[๋ฐฑ์ค€]10773-์ œ๋กœ  (0) 2023.01.05
    '๐Ÿ–ฅ๏ธSW Engineer/Algorithm' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€
    • [๋ฐฑ์ค€]1966-ํ”„๋ฆฐํ„ฐ ํ
    • [๋ฐฑ์ค€]2609-์ตœ๋Œ€๊ณต์•ฝ์ˆ˜์™€ ์ตœ์†Œ๊ณต๋ฐฐ์ˆ˜ ๊ตฌํ•˜๊ธฐ
    • [๋ฐฑ์ค€]11651-์ขŒํ‘œ ์ •๋ ฌํ•˜๊ธฐ2
    • [๋ฐฑ์ค€]10773-์ œ๋กœ
    ์•ž๋™๋„คJIHOON
    ์•ž๋™๋„คJIHOON
    Every step repository / Data && Engineering

    ํ‹ฐ์Šคํ† ๋ฆฌํˆด๋ฐ”