λ°μν
Notice
Recent Posts
Recent Comments
Link
μΌ | μ | ν | μ | λͺ© | κΈ | ν |
---|---|---|---|---|---|---|
1 | 2 | 3 | ||||
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |
Tags
- λ°±μ€
- sql
- μ΄μ§μ λ³ν
- dacon
- mysql
- μ ν ν¬ νμ΄μ¬
- μλ°
- λΈλΌμ°μ μ€ν
- νμ λ³μ
- λ€μ΅μ€νΈλΌ μκ³ λ¦¬μ¦
- λ°μ€κ·Έλν
- java
- μ°Έμ‘° λ³μ
- νλ‘κ·Έλλ¨Έμ€
- ν©ν λ¦¬μΌ μ§λ²
- μ§ κ° μμΈ‘ λΆμ
- DFS
- μ΄κ²μ΄ μ·¨μ μ μν μ½λ©ν μ€νΈλ€
- μ΅μ
- jdbc
- np.zeros_like
- 2BPerfect
- PYTHON
- Extended Slices
- matplotlib
- BFS
- MacOS
- μμ΄
- Do it
- Do_it
Archives
- Today
- Total
π¦ κ³΅λ£‘μ΄ λμ!
μ¬κ·ν¨μ λ³Έλ¬Έ
- λ©μλ νΉμ ν¨μμ λ΄λΆμμ μκΈ°μμ μ λ©μλ νΉμ ν¨μλ₯Ό λ€μ νΈμΆνλ ν¨μ
-
#λ°λ³΅λ¬Έ νμ© μμ νμ data=[3,5,8] result =set() for i in range(2): for j in range(2): for k in range(2): result.add(data[0]*i+data[1]*j+data[2]*k) print(result) {0,3,5,8,11,13,16} #μ½λμ κ°κ²°ν λ° λ³μ μ΅μν #μ¬κ· ν¨μλ₯Ό νμ©ν μμ νμ def recur(index,value) if index==len(data): ## μ¬κ·ν¨μ μ’ λ£ κ΅¬λ¬Έ result.add(value) else: recur(index+1, value+data[index]) recur(index+1, value) result=set() recur(0,0) print(result) # ν©ν λ¦¬μΌ def factorial(n): if n==1: return 1 else: return n*factorial(n-1) #νΌλ³΄λμΉ μμ΄ def fivo(n): if n==0||n==1: return 1 else: return fivo(n-1) +fivo(n-2)
λ°μν
'Development > CodingTest' μΉ΄ν κ³ λ¦¬μ λ€λ₯Έ κΈ
[λ°±μ€]Python ν©ν λ¦¬μΌ (0) | 2022.01.19 |
---|---|
[λ°±μ€]Python μ΄μ§μ λ³ν (0) | 2022.01.19 |
[νλ‘κ·Έλλ¨Έμ€] Python μ νλ²νΈ λͺ©λ‘ (0) | 2022.01.18 |
[λ°±μ€] Python ν΄μ±(hashing) (0) | 2022.01.18 |
[νλ‘κ·Έλλ¨Έμ€] Python μμ£Όνμ§ λͺ»ν μ μ (0) | 2022.01.13 |
Comments