ํ์ด์ฌ์ด๋ ์นํด์ง๊ธฐ
ํ์ด์ฌ์์๋ ์์ด๊ณผ ์กฐํฉ์ ์ํ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ์ ๊ณตํด์ค๋ค.
from itertools import combinations
a = [1, 2, 3, 4]
for i in combinations(a, 3):
print(i)
# ๊ฒฐ๊ณผ
# (1, 2, 3)
# (1, 2, 4)
# (1, 3, 4)
# (2, 3, 4)
combinations ํจ์๋ฅผ ํตํด ํน์ ๋ฆฌ์คํธ์ ์๋ ์์๋ค์ ์กฐํฉ์ผ๋ก ํํํ ์ ์๋ค.
์ด๋ ๋ฐํ๋๋ ๊ฐ์ iteratable ๊ฐ์ฒด์ด๋ฉฐ for๋ฌธ์ผ๋ก ์ํํ ์ ์๋ค.
from itertools import permutations
a = [1, 2, 3, 4]
for i in permutations(a, 3):
print(i)
# ๊ฒฐ๊ณผ
# (1, 2, 3)
# (1, 2, 4)
# (1, 3, 2)
# (1, 3, 4)
# (1, 4, 2)
# (1, 4, 3)
# (2, 1, 3)
# (2, 1, 4)
# (2, 3, 1)
# ...
permutations ํจ์๋ฅผ ์ด์ฉํ์ฌ ์์ด๋ ๊ตฌํ ์ ์๋ค.
์ฝ๋
from itertools import combinations
def solution(number):
return len([1 for i in combinations(number,3) if sum(i) == 0])
'๐ฅ๏ธ Computer > Algorithm Solution' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[ํ๋ก๊ทธ๋๋จธ์ค] level1 : ์ถ์ต ์ ์ (1) | 2023.08.05 |
---|---|
[ํ๋ก๊ทธ๋๋จธ์ค] level1 : ๊ฐ์ฅ ๊ฐ๊น์ด ๊ฐ์ ๊ธ์ (0) | 2023.08.05 |
[ํ๋ก๊ทธ๋๋จธ์ค] level1 : 3์ง๋ฒ ๋ค์ง๊ธฐ (0) | 2023.08.02 |
[ํ๋ก๊ทธ๋๋จธ์ค] level1 : ์ต๋๊ณต์ฝ์์ ์ต์๊ณต๋ฐฐ์ (0) | 2023.07.31 |
[ํ๋ก๊ทธ๋๋จธ์ค] level1 : ๋ฌธ์์ด ๋ค๋ฃจ๊ธฐ ๊ธฐ๋ณธ (1) | 2023.07.31 |