Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Bigger Together solution in Clear category for Bigger Together by JimmyCarlos
def iterate_L(A,s):
if len(A) == 0: return int(s)
L = float("inf")
for I,V in enumerate(A):
if V[0] > A[0][0]: continue
A_new,s_new = [v for i,v in enumerate(A) if i != I],s+str(V)
L_new = int(iterate_L(A_new,s_new))
L = min(L,L_new)
return L
def iterate_H(A,s):
if len(A) == 0: return s
H = float("-inf")
for I,V in enumerate(A):
if V[0] < A[0][0]: continue
A_new,s_new = [v for i,v in enumerate(A) if i != I],s+str(V)
H_new = int(iterate_H(A_new,s_new))
H = max(H,H_new)
return H
def bigger_together(A):
A = sorted(str(x) for x in A)
return iterate_H(A[::-1],"") - iterate_L(A,"")
May 31, 2019