Later_Fall的专栏

Question:codility Lesson16 Max-Nonoverlapping-SegmentsMy Answer:def solution(A,B): if len(A) < 2: return len(A) res = 1 end = B[0] for i in range(1,len(A)): if A[i] > end:

Question:codility Lesson3 PermMissingElemMy answer:def solution(A): length = len(A) return (1 + length + 1) * length / 2 - sum(A)

Question:codility Lesson3 TapeEquilibriumMy answer:def solution(A): part1 = A[0] part2 = sum(A[1:]) minres = abs(part1 - part2) for i in range(1,len(A) - 1): part1 += A[i]

Question:codility Lesson3 FrogJmpMy answer:def solution(X, Y, D): distance = Y - X if distance % D == 0: return distance / D else: return distance / D + 1

Question:codility Lesson2 CyclicRotationMy Answer:def solution(A,K): length = len(A) if length == 0: return A K = K % A A = A[- K:] + A[:-K] return A

Question:codility Lesson2 OddOccurrencesInArrayMy answer:def solution(A): result = 0 for num in A: result ^= num return result

Question:codility Lesson1 BinaryGapMy answer:def solution(N): len_max = 0 len_cur = 0 flag = 0 Nstr = bin(N).replace('0b','') length = len(Nstr) for i in range(length):

Question:codility Lesson6 MaxProductOfThreeMy Answer:def solution(A): A.sort() return max(A[0] * A[1] * A[-1],A[-1] * A[-2] * A[-3])

Question:codility Lesson7 BracketsMy Answer:def soluton(S): if len(S) % 2 == 1: return 0 nested = {"]":"[","}":"{",")":"("} half = ["[","{","("] stack = [] for ele in S:

Question:codility Lesson7 FishMy Answer:def solution(A,B): cnt = 0 downstream = [] downcnt = 0 for i in range(len(A)): if B[i] == 1: downstream.append(A[i]) e

Question:codility Lesson4 MissingIntegerMy answer:def solution(A): B = set((i for i in A if i > 0)) if B: return next((i for i in range(1,len(B) + 2) if not i in B),1) return 1

Question:codility Lesson4 PermCheckMy answer:def solution(A): if set(A) == set(range(1, 1 + len(A))): return 1 else: return 0

Question:codility Lesson16 Tie RopesMy Answer:def solution(K,A): res = 0 length = 0 for rope in A: length += rope if length >= K: res += 1 length = 0

Question:codility Lesson6 TriangleMy Answer:def solution(A): A.sort() if len(A) < 3: return 0 for i in range(0,len(A) - 2): if A[i] + A[i + 1] > A[i + 2]: return

Question：codility Lesson6 DistinctMy Answer:def solution(A): return len(set(A))

Question: codility Lesson5 GenomicRangeQueryMy Answer:def solution(S,P,Q): res = [] slen = len(S) dic = {'A':1,'C':2,'G':3,'T':4} next_pos = [[-1] * slen,[-1] * slen,[-1] * slen,[-1] * s

Question:codility Lesson5 MinAvgTwoSliceMy answer:def solution(A): min_avg = (A[0] + A[1])/2.0 avg_pos = 0 for i in xrange(1,len(A) - 2): if (A[i] + A[i + 1]) / 2.0 < min_avg:

Question:codility Lesson5 CountDivMy answer:def solution(A,B,K): return B // K - A // K + (1 if A % K == 0 else 0)

Question:codility Lesson5 PassingCarsMy answer:def soluiton(A): east = 0 pairs = 0 for i in xrange(len(A)): #print i,A[i] if A[i] == 0: east += 1 elif A[i

Question:codility Lesson4 MaxCountersMy answer:def solution(N,A): res = [0] * N maxnum = 0 curmax = 0 for com in A: if 1 <= com <= N: if maxnum > res[com - 1]:

Question:codility Lesson4 FrogRiverOneMy answer:def solution(X,A): B = [0] * (X + 1) sumA = 0 for i in range(len(A)): if B[A[i]] == 0: B[A[i]] == 1 sumA += 1

Question:codility Lesson7 StoneWallMy Answer:def solution(H): blockcnt = 0 stack = [] for height in H: while len(stack) != 0 and stack[-1] > height: stack.pop()

Question:codility Lesson7 NestingMy Answer:def solution(S): if len(S) % 2 == 1: return 0 num = 0 for ele in S: if ele == "(": num += 1 else: n

Question:codility Lesson11 CountSemiprimesMy Answer:from math import sqrtdef solution(N,P,Q): sieve = [True] * (N + 1) sieve[0] = False sieve[1] = False prime = [] i = 2 while i

Question:codility Lesson11 CountNonDivisibledef solution(A): maxA = max(A) lenA = len(A) cnt = {} for ele in A: if ele not in cnt: cnt[ele] = 1 else:

Question: codility Lesson13 FibFrogMy Answer:def fibonacci(n): fib = [1,1] while fib[-1] < n: fib.append(fib[-1] + fib[-2]) return fib[1:-1]def solution(A): jumps = fibonacci(le

Question:codility Ladder QuestionMy Answer:def solution(A,B): ladder = max(A) maxB = max(B) fib = [0] * (ladder + 2) fib[1] = 1 for i in range(2,ladder + 2): fib[i] = ((fib[i

Question:codility Lesson17 MinAbsSumMy Answer:def solution(A): newA = [abs(i) for i in A] totalsum = sum(newA) #print(totalsum) dic = {} for ele in newA: dic[ele] = dic.get(ele

Question:codility Lesson17 NumberSolitaireMy Answer:def solution(A): maxnum = [A[0]] * (len(A) + 6) for i in range(1,len(A)): maxnum[i + 6] = max(maxnum[i : i + 6]) + A[i] return maxn

Question:codility Lesson 15 MinAbsSumOfTwoMy Answer:def solution(A): lenA = len(A) A.sort() if A[0] >= 0: return A[0] + A[0] if A[-1] <= 0: return abs(A[-1] + A[-1]) fro

Question:codility Lesson15 CountDistinctSlicesMy Answer:def solution(A): A.sort() lenA = len(A) res = 0 for i in range(lenA - 2): k = i + 2 for j in range(i + 1,lenA - 1):

Question:codility Lesson15 CountDistinctSlicesMy Answer:def solution(M,A): front = 0 back = 0 lenA = len(A) res = 0 exist = [-1] * (M + 1) for front in range(lenA): if ex

Question:codility Lesson10 MinPerimeterRectangleMy Answer:def gcd(a,b): if (a % b == 0): return b else: return gcd(b,a%b)def solution(A,B): cnt = 0 for i in range(len(A

Question:codility Lesson12 ChocolatesByNumbersMy Answer:def gcb(a,b): if(a % b == 0): return b else: return gcb(b,a%b)def solution(N,M): return N/gcb(N,M)

Question:codility Lesson8 EquiLeaderMy Answer:def solution(A): lenA = len(A) candidata = -1 cnt = 0 for i in range(lenA): if cnt == 0: candidata = A[i] c

Question:codility Lesson8 DominatorMy Answer:def solution(A): lenA = len(A) candidate = -1 candidatecnt = 0 index = -1 for i in range(lenA): if candidatecnt == 0:

Question:codility Lesson9 MaxSliceSumMy Answer:def solution(A): max_slice_ending = A[0] max_slice = A[0] for ele in A[1:]: max_slice_ending = max(ele,max_slice_ending + ele)

Question:codility Lesson9 MaxDoubleSliceSumMy Answer:def solution(A): lenA = len(A) maxdoublesum = 0 maxslice = 0 maxcur = 0 minele = A[1] if A[1] > 0 else 0 for i in range(2,len

Question:codility Lesson9 MaxProfitMy Answer:def solution(A): maxprofit = 0 max_ending = 0 for i in range(1,len(A)): max_ending = max(0,max_ending + A[i] - A[i - 1]) maxprof

Question:codility Lesson10 MinPerimeterRectangleMy Answer:from math import sqrtdef solution(N): for i in range(int(sqrt(N)),0,-1): if N % i == 0: return 2 * (i + N/i)