def permutations_order(): def is_duplicated(seq): seq_copy = set(list(seq)) return len(seq_copy) != len(seq) outcomes = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9"] all_set = gen_all_sequences(outcomes, 5) all_set = [item for item in all_set if not is_duplicated(item)] print len(all_set)
def gen_permutations(outcomes, length): """ Iterative function that generates set of permutations of outcomes of length num_trials No repeated outcomes allowed """ all_set = gen_all_sequences(outcomes, length) print len(all_set) all_set = [item for item in all_set if not is_duplicated(item)] # add code here print len(all_set) return set(all_set)
""" test as a shell """ from Yahtzee import gen_all_sequences outcomes = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9"] all_set = gen_all_sequences(outcomes, 5) def filter_set(seq): pass def is_des(seq): for idx in range(1, len(seq)): if seq[idx] <= seq[idx-1]: continue else: return False return True def is_asc(seq): for idx in range(1, len(seq)): if seq[idx] >= seq[idx-1]: continue else: return False return True size = len(all_set) total = 0.0