Python的蛮力算法 [英] Python Brute Force algorithm

问题描述

我需要生成从给定的charset每个可能的组合，以在给定范围。 像，

I need to generate every possible combination from a given charset to a given range. Like,

charset=list(map(str,"abcdefghijklmnopqrstuvwxyz"))
range=10

而放出来应该是，

And the out put should be,

[a,b,c,d..................,zzzzzzzzzy,zzzzzzzzzz]

我知道使用已在使用libraries.But我需要知道如何他们真的works.If任何人都可以给我这种算法在Python或任何编程语言可读性的评论code我能做到这一点，我将不胜感激。

I know I can do this using already in use libraries.But I need to know how they really works.If anyone can give me a commented code of this kind of algorithm in Python or any programming language readable,I would be very grateful.

推荐答案

如果你真的想蛮力它，试试这个，但它会带你一段荒唐量：

If you REALLY want to brute force it, try this, but it will take you a ridiculous amount of time:

your_list = 'abcdefghijklmnopqrstuvwxyz'
complete_list = []
for current in xrange(10):
    a = [i for i in your_list]
    for y in xrange(current):
        a = [x+i for i in your_list for x in a]
    complete_list = complete_list+a

在一个小的例子，在列表='AB'，我们只去了5个，这将打印以下内容：

On a smaller example, where list = 'ab' and we only go up to 5, this prints the following:

['a', 'b', 'aa', 'ba', 'ab', 'bb', 'aaa', 'baa', 'aba', 'bba', 'aab', 'bab', 'abb', 'bbb', 'aaaa', 'baaa', 'abaa', 'bbaa', 'aaba', 'baba', 'abba', 'bbba', 'aaab', 'baab', 'abab', 'bbab', 'aabb', 'babb', 'abbb', 'bbbb', 'aaaaa', 'baaaa', 'abaaa', 'bbaaa', 'aabaa', 'babaa', 'abbaa', 'bbbaa', 'aaaba','baaba', 'ababa', 'bbaba', 'aabba', 'babba', 'abbba', 'bbbba', 'aaaab', 'baaab', 'abaab', 'bbaab', 'aabab', 'babab', 'abbab', 'bbbab', 'aaabb', 'baabb', 'ababb', 'bbabb', 'aabbb', 'babbb', 'abbbb', 'bbbbb']

这篇关于Python的蛮力算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！