목록Python (130)

몸과 마음이 건전한 SW 개발자

Softeer Level 3 통근버스 출발 순서 검증하기 Python

문제 링크 https://softeer.ai/practice/6257 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 정답 코드 import sys input = sys.stdin.readline N = int(input()) busStation = list(map(int, input().split())) result = 0 for idx in range(N-1): valueIdx = busStation[idx] isNotPossible = 0 for jdx in range(idx+1, N): valueJdx = busStation[jdx] if valueIdx < valueJdx: isNotPossible += 1 else: result += isNotPossible print(r..
알고리즘 2024. 2. 8. 21:27
Softeer Level 3 거리 합 구하기 Python

문제 링크 https://softeer.ai/practice/6258 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 정답 코드 import sys sys.setrecursionlimit(10**6) input = sys.stdin.readline nodeDict = dict() N = int(input()) adjL = [[] for _ in range(N+1)] for _ in range(N-1): start, to, distance = map(int, input().split()) adjL[start].append(to) adjL[to].append(start) nodeDict[(start, to)] = distance nodeDict[(to, start)] = distance..
알고리즘 2024. 2. 8. 21:19
Softeer Level 4 징검다리 2 Python [반례 포함]

문제 링크 https://softeer.ai/practice/6290 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 정답 코드 import sys input = sys.stdin.readline N = int(input()) stones = list(map(int, input().split())) def dpOfLIS(stones, N): dp = [0 for _ in range(N)] def binarySearch(stack, height): left, right = 0, len(stack) - 1 while left
알고리즘 2024. 2. 4. 17:56
Softeer Level 3 GINI야 도와줘 Python

문제 링크 https://softeer.ai/practice/6271 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 정답 코드 import sys from collections import deque input = sys.stdin.readline R, C = map(int, input().split()) guidance = [] shower = [] boundaryShower = [] sr, sc = 0, 0 er, ec = 0, 0 def isValid(nr, nc): return 0
알고리즘 2024. 1. 29. 22:03
Softeer Level 3 우물 안 개구리 Python

문제 링크 https://softeer.ai/practice/6289 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 정답 코드 import sys input = sys.stdin.readline N, M = map(int, input().split()) weights = list(map(int, input().split())) adjL = [[] for _ in range(N+1)] for _ in range(M): start, to = map(int, input().split()) adjL[start].append(to) adjL[to].append(start) V = [1 for _ in range(N+1)] for p in range(1, N+1): currentPW = we..
알고리즘 2024. 1. 29. 21:50
프로그래머스 Lv. 2 문자열 압축 Python

문제 링크 https://school.programmers.co.kr/tryouts/72056/challenges 정답 코드 def solution(s): answer = 1001 lenS = len(s) if lenS == 1: return 1 for cut in range(1, lenS//2+1): stack = [] length = [1 for _ in range(lenS//cut+1)] lengthIdx = 0 string = "" for idx in range(lenS): alpha = s[idx] string += alpha if len(string) == cut: if stack: if stack[-1] == string: length[lengthIdx] += 1 else: stack.app..
알고리즘 2024. 1. 8. 15:26
이전 Prev 1 ··· 12 13 14 15 16 17 18 ··· 22 Next 다음