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

Commit 3b2edb5

Browse files
KanuKim97KanuKim97
committed
programmers
1 parent 7a5ef32 commit 3b2edb5

15 files changed

+71
-0
lines changed

‎Programmers/level0/각도기.py

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
def solution(angle):
2+
if angle < 90 and angle > 0:
3+
return 1
4+
if angle == 90:
5+
return 2
6+
if angle > 90 and angle < 180:
7+
return 3
8+
if angle == 180:
9+
return 4

‎Programmers/level0/나이출력.py

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
def solution(age):
2+
return 2022-age+1

‎Programmers/level0/머쓱이 보다 키 큰 사람.py

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
def solution(array, height):
2+
answer = 0
3+
array.sort()
4+
5+
for i in range(len(array)):
6+
if height < array[i]:
7+
answer += 1
8+
9+
return answer

‎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(reversed(my_string))

‎Programmers/level0/배열 뒤집기.py

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
def solution(num_list):
2+
num_list.reverse()
3+
return num_list

‎Programmers/level0/배열 자르기.py

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
def solution(numbers, num1, num2):
2+
return numbers[num1:num2+1]

‎Programmers/level0/배열의 평균 값.py

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
def solution(numbers):
2+
return sum(numbers)/len(numbers)

‎Programmers/level0/양꼬치.py

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
def solution(n, k):
2+
return (n*12000)-(int(n/10) * 2000)+(k*2000)

‎Programmers/level0/점의 위치 구하기.py

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
def solution(dot):
2+
if dot[0] > 0:
3+
if dot[1] > 0:
4+
return 1
5+
else :
6+
return 4
7+
else :
8+
if dot[1] > 0:
9+
return 2
10+
else :
11+
return 3

‎Programmers/level0/중복된 숫자의 개수.py

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
def solution(array, n):
2+
return array.count(n)

0 commit comments

Comments
 (0)
0