전체 글

def buildPalindrome(st): RE = st[::-1] if st == RE: return st for i in range(1, len(st)): if (st + RE[-i:]) == (st[:i]+RE): return (st[:i]+RE)

def findEmailDomain(address): return address.split('@')[-1]

def isBeautifulString(inputString): from string import ascii_lowercase alpha_list = list(ascii_lowercase) # 비교할 알파벳 소문자 리스트 IS = list(set(inputString)) IS.sort() print(IS) IL = [] for i in range(len(IS)): total = 0 for j in range(len(inputString)): if IS[i] != alpha_list[i]: return False elif IS[i] == inputString[j]: total += 1 IL.append(total) print(IL) for k in range(len(IL)-1): if IL[k] < IL[..

def bishopAndPawn(bishop, pawn): return abs(ord(bishop[0])-ord(pawn[0]))==abs(int(pawn[1])-int(bishop[1]))

def digitDegree(n): if n < 10: return 0 sumOfDigits = sum([int(i) for i in str(n)]) return digitDegree(sumOfDigits) + 1

def longestDigitsPrefix(inputString): MAKE = [] TEMP = list(inputString) if TEMP[0].isdigit() == True: for i in range(len(TEMP)): if TEMP[i].isdigit() == True: MAKE.append(TEMP[i]) else: return ''.join(MAKE) else: return "" return ''.join(MAKE)

def knapsackLight(value1, weight1, value2, weight2, maxW): if maxW >= weight1+weight2: return value1 + value2 elif maxW = weight1 and maxW >= weight2: return max(value1, value2) elif maxW >= weight1 and maxW = weight2 and maxW < weight1: return value2 elif maxW < weight2 and maxW < weight1: return 0 메모장에 대충 떠오르는 조건들 써넣는 방식으로 할 땐 5/8..

# def growingPlant(upSpeed, downSpeed, desiredHeight): if desiredHeight

def arrayMaxConsecutiveSum(inputArray, k): SOR = [] for i in range(len(inputArray)): total = 0 for j in range(i, i+k): if (i+k)

def differentSymbolsNaive(s): return len(set(s))

def firstDigit(inputString): LIST = list(inputString) print(LIST) for i in range(len(LIST)): if LIST[i].isdigit() == True: return LIST[i]

def extractEachKth(inputArray, k): array=[] for i in range(len(inputArray)): if (i+1)%k != 0: array.append(inputArray[i]) return array