Python练习题答案: 从整数组合的排列得分【难度：2级】--景越Python编程实例训练营,1000道上机题等你来挑战

从整数组合的排列得分【难度:2级】:

答案1:

from itertools import permutations

def sc_perm_comb(num):
    sNum = str(num)
    return sum({ int(''.join(p)) for d in range(1, len(sNum)+1) for p in permutations(sNum, d) })​

答案2:

import itertools


def sc_perm_comb(num):
    return sum([int(''.join(p)) for i in range(1, len(str(num)) + 1) for p in set(itertools.permutations(str(num), i)) if p[0] != "0" ])
​

答案3:

import itertools
def sc_perm_comb(num):
    total=0
    for k in range(1,len(str(num))+1):
      t=set((itertools.permutations(str(num),k)))
      for l in t:
        temp=''.join(l)
        if(temp[0:1]!='0'):
            total+=int(temp)
    return total​

答案4:

def sc_perm_comb(num):
    return sum(int("".join(i)) for j in xrange(1, len(str(num))+1) for i in set(__import__("itertools").permutations(str(num), j)) if i[0] != '0')​

答案5:

sc_perm_comb=lambda n:sum({int(''.join(p))for r in range(len(str(n)))for p in __import__('itertools').permutations(str(n),r+1)})​

答案6:

from itertools import permutations
def sc_perm_comb(num):
    s = str(num)
    return sum({int(''.join(p)) for c, _ in enumerate(s, 1) for p in permutations(s, c)})​

答案7:

import itertools

def sc_perm_comb(num):
  input=list(str(num))
  c,s,r,arr=0,{},[],sum([map(list,itertools.combinations(input,i)) for i in range(len(input)+1)],[])
  for a in arr: r+=itertools.permutations(a)
  for a in r: 
    if len(a): 
      v=int(''.join(a))
      if not v in s: s[v]=1; c+=int(v)
  return c​

答案8:

import itertools
def sc_perm_comb(num):
    line = []
    for i in range(len(str(num))):
        line += [int(''.join(n)) for n in itertools.permutations(list(str(num)), i+1)]
    return sum(set(line))
    ​

答案9:

from itertools import permutations as perms

def sc_perm_comb(num):
    total = 0
    seen = set()
    for i in xrange(1, len(str(num)) + 1):
        for p in perms(str(num), i):
            seen.add("".join(p))
    
    for s in seen:
        if s.startswith("0"):
            continue
        total += int(s)
    
    return total​

答案10:

from itertools import combinations, permutations

def sc_perm_comb(n):
  if n < 10: return n
  xs = str(n)
  ss = set()
  for k in range(1, len(xs) + 1):
    for c in set(''.join(c) for c in combinations(xs, k)):
      ss |= set(int(''.join(p)) for p in permutations(c) if p[0] != '0')
  return sum(ss)​