분류 전체보기

def fileNaming(names): for i in range(len(names)): total = 0 for j in range(i+1, len(names)): if names[i] == names[j]: total += 1 names[j] = names[j]+'('+str(total)+')' print(names[i], names[j]) return names 4/6 sample tests passed.

def digitsProduct(product): def is_prime_bad(n: int) -> bool: if n 10: return -1 for i in range(2,20): for j in range(2,20): if i*j == product: temp.append(str(i)+str(j)) if temp == []: return -1 else: return int(min(temp)) 3/9 sample tests passed.

import numpy as np def differentSquares(matrix): temp = [] #for i in range(0,2): for i in range(len(matrix)-1): #for j in range(0,2): for j in range(len(matrix[0])-1): row1 = [] row2 = [] row = [] row1 = matrix[i][j:j+2] row2 = matrix[i+1][j:j+2] #print("row1, row2",row1, row2) row.append(row1) row.append(row2) #print("row", row) temp.append(row) #print(row) #print("temp",temp,len(temp)) def uni..

import re def sumUpNumbers(inputString): numbers = re.findall("\d+", inputString) temp = [] for i in range(len(numbers)): temp.append(int(numbers[i])) return sum(temp)

def validTime(time): h,m=map(int,time.split(":")) return 0

import re import operator def longestWord(text): #LIST = list(re.findall(r"[\w']+", text)) LIST = list(filter(None, re.split("[, '['_\-!?:]+", text))) print (LIST) a = {} for i in range(len(LIST)): a[LIST[i]] = len(LIST[i]) print (a) key_max = max(a.items(), key=operator.itemgetter(1))[0] return key_max text = "ab-CDE-fg_hi" longestWord(text) # "Ready, steady, go!" = "steady". # "To be or not to..

def deleteDigit(n): num = str(n) temp = [] for i in range(len(num)): if i==0: temp.append(int(num[1:])) elif 0 < i < (len(num)-1): temp.append(int(num[:i]+num[i+1:])) elif i == (len(num)-1): temp.append(int(num[:i])) return max(temp)

def chessKnight(cell): tot=0 X = ord(cell[0])-96 Y = int(cell[1]) if 1

def lineEncoding(s): A = [] j = 0 for i in range(len(s)): tot = 0 print("while 전",i,j,s[i],s[j]) #if j == len(s): # continue while s[i] == s[j]: if s[i] == s[j]: tot += 1 #print("while안",i,j,s[i],s[j],tot) j += 1 #print("return 직전",i,j,s[i],s[j],tot) #print("append 직전",i,j,s[i],s[j],tot) print(tot) if tot != 0: A.append(str(tot)+s[i]) print(A,i,j) return A s = "aabbbc" lineEncoding(s) # "aabbbc"..

def isDigit(symbol): return symbol.isdigit()

def isMAC48Address(inputString): MAC = inputString.split('-') HEX = ['1', '2', '3', '4','5','6','7','8','9','0','A','B','C','D','E','F'] if len(MAC) != 6: return False for k in range(6): if len(MAC[k]) != 2: return False for i in range(6): for j in range(2): if MAC[i][j] in HEX: continue else: return False return True

def electionsWinners(votes, k): FINAL = 0 votes.sort() if k==0 and votes[-1] != votes[-2]: return 1 for i in range(len(votes)): if votes[-i]+k > max(votes): FINAL += 1 return FINAL 10/12 tests passed. Execution time limit exceeded on test 11: Program exceeded the execution time limit. Make sure that it completes execution in a few seconds for any possible input. 알고리즘 자체는 맞았는데 저런 메시지 나와서 포기. sort..