Lv2 파이썬 완료

Author: wh2per

Programmers/Lv2/Lv2_124나라의숫자.py

@@ -0,0 +1,14 @@
+def solution(n):
+    answer = ''
+    arr = [1, 2, 4]
+    r = -1
+
+    while n > 0:
+        n -= 1
+        r = n % 3
+        answer += str(arr[n % 3])
+        n = n // 3
+
+    answer = answer[::-1]
+
+    return answer

Programmers/Lv2/Lv2_H-Index.py

@@ -0,0 +1,9 @@
+def solution(citations):
+    answer = 0
+    citations.sort(reverse=True)
+    for i in range(len(citations)):
+        if i+1 > citations[i]:    # 처음으로 넘는 인덱스가 나오면
+            return i              # 이전 인덱스 반환
+    return len(citations)
+
+print(solution([0, 1, 3, 5, 6]))

Programmers/Lv2/Lv2_JadenCase문자열만들기.py

@@ -0,0 +1,16 @@
+def solution(s):
+    answer = ''
+    flag = True
+    for i in s:
+        if flag and not i.isdigit():
+            answer += i.upper()
+            flag = False
+        else:
+            answer += i.lower()
+            flag = False
+
+        if i.isspace():
+            flag = True
+    return answer
+
+print(solution("332people                     #unFollowed m3e   "))

Programmers/Lv2/Lv2_N개의최소공배수.py

@@ -0,0 +1,6 @@
+import fractions
+def solution(arr):
+    answer = arr[0]
+    for i in arr:
+        answer = i * answer / fractions.gcd(i, answer)
+    return answer

Programmers/Lv2/Lv2_가장큰수.py

@@ -0,0 +1,13 @@
+import functools
+
+def comparator(a,b):
+    t1 = a+b
+    t2 = b+a
+    return int(t1) - int(t2) #  t1이 크다면 1, t2가 크다면 -1   같으면 0
+
+def solution(numbers):
+    n = [str(x) for x in numbers]
+    n = sorted(n, key=functools.cmp_to_key(comparator),reverse=True)
+    return str(int(''.join(n)))
+
+print(solution([3, 30, 34, 5, 9]))

Programmers/Lv2/Lv2_가장큰정사각형찾기.py

@@ -0,0 +1,18 @@
+def solution(board):
+    answer = 0
+    xlen = len(board[0])
+    ylen = len(board)
+
+    if xlen < 2 or ylen < 2:        # 가로, 세로 중 하나라도 길이가 1이라면
+        for i in range(ylen):
+            for j in range(xlen):
+                if board[i][j] == 1:
+                    answer = 1
+    else:
+        for i in range(1,ylen):
+            for j in range(1,xlen):
+                if board[i][j] == 1:
+                    board[i][j] = min(board[i][j - 1], board[i - 1][j], board[i - 1][j - 1]) + 1
+                    if answer < board[i][j]:
+                        answer = board[i][j]
+    return answer * answer

Programmers/Lv2/Lv2_구명보트.py

@@ -0,0 +1,13 @@
+def solution(people, limit):
+    answer = 0
+    people.sort(reverse=True)       # 내림차순 정렬
+    a = 0
+    b = len(people)-1
+    while a<=b:
+        if people[a] + people[b] <= limit:
+            b -= 1
+        answer += 1
+        a += 1
+    return answer
+
+print(solution([70, 80, 50], 100))

Programmers/Lv2/Lv2_기능개발.py

@@ -0,0 +1,23 @@
+def solution(progresses, speeds):
+    answer = []
+    temp = []
+    for i, j in zip(progresses, speeds):
+        diff = 100 - i
+        count = 0
+        if diff%j==0:
+            count = diff//j
+        else:
+            count = (diff//j)+1
+        temp.append(count)
+    temp.reverse()
+    while len(temp)>0:
+        t1 = temp[-1]       # 최상위
+        t2 = 1              # 1개로 초기화
+        temp.pop()          # 제거
+        while len(temp)!=0 and temp[-1] <= t1:      # 최상위가 나랑 같거나 작으면 추가
+            temp.pop()
+            t2 += 1
+        answer.append(t2)
+    return answer
+
+print(solution(	[93, 30, 55], [1, 30, 5]))

Programmers/Lv2/Lv2_다리를지나는트럭.py

@@ -0,0 +1,17 @@
+def solution(bridge_length, weight, truck_weights):
+    q = []
+    time = 0
+    total = 0
+
+    while len(truck_weights) > 0 or len(q) > 0:
+        time += 1
+        if len(q) > 0 and time - q[0][1] == bridge_length:
+            temp = q.pop(0)[0]
+            total -= temp
+
+        if len(truck_weights) > 0 and total + truck_weights[0] <= weight:
+            next = truck_weights.pop(0)
+            q.append((next, time))
+            total += next
+
+    return time

Programmers/Lv2/Lv2_다음큰숫자.py

@@ -0,0 +1,5 @@
+def solution(n):
+    tc = bin(n).count('1')
+    for i in range(n+1, 1000001):
+        if bin(i).count('1') == tc:
+            return i