8000 programmers · KanuKim97/Algorithm@aa1e0b1 · GitHub
[go: up one dir, main page]
Skip to content

Commit aa1e0b1

Browse files
KanuKim97KanuKim97
committed
programmers
1 parent e358f0d commit aa1e0b1

File tree

6 files changed

+51
-0
lines changed

6 files changed

+51
-0
lines changed

‎Programmers/level0/369게임 .py

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
def solution(order):
2+
answer = 0
3+
lo = (list(str(order)))
4+
for i in range(len(lo)):
5+
if lo[i] in "3" or lo[i] in "6" or lo[i] in "9":
6+
answer += 1
7+
8+
return answer

‎Programmers/level0/A로 B만들기.py

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
def solution(before, after):
2+
bl = list(before)
3+
al = list(after)
4+
5+
for i in bl:
6+
if i in al:
7+
al.remove(i)
8+
9+
if len(al) == 0:
10+
return 1
11+
else :
12+
return 0

‎Programmers/level0/배열 회전시키기.py

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
def solution(numbers, direction):
2+
if direction == "right":
3+
return numbers[len(numbers)-1:] + numbers[:len(numbers)-1]
4+
else :
5+
return numbers[-(len(numbers)-1):] + numbers[:-(len(numbers)-1)]

‎Programmers/level0/이진수 더하기.py

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
def solution(bin1, bin2):
2+
decimal_1, decimal_2 = 0, 0
3+
l_bin1 = list(bin1)
4+
l_bin2 = list(bin2)
5+
6+
for i in range(len(l_bin1)):
7+
decimal_1 += int(l_bin1.pop()) * 2 ** i
8+
9+
for i in range(len(l_bin2)):
10+
decimal_2 += int(l_bin2.pop()) * 2 ** i
11+
12+
return format(decimal_1 + decimal_2, 'b')

‎Programmers/level0/중복된 문자 제거.py

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
def solution(my_string):
2+
return ''.join(dict.fromkeys(my_string))

‎Programmers/level0/팩토리얼.py

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
def solution(n):
2+
temp = 0
3+
for i in range(1, 100):
4+
temp = factorial(i)
5+
if temp > n:
6+
return i-1
7+
8+
def factorial(n):
9+
if n > 1:
10+
return n * factorial(n-1)
11+
else :
12+
return 1

0 commit comments

Comments
 (0)
0