Ruby排列计算

以下代码由PHP站长网 52php.cn收集自互联网

现在PHP站长网小编把它分享给大家，仅供参考

#!/usr/bin/env ruby

# PERMUTATIONS COMPUTER
# based on Bogomolyn algorithm
# http://www.bearcave.com/random_hacks/permute.html
# Author: Alessio Saltarin http://axsaxs.altervista.org/

class PermutationComputer

  attr_reader :bigbox  # Array of permutations
  attr_reader :count   # Number of elements found

  def initialize(size)
    @permutationSize = size
    @bigbox = Array.new
    @level = -1
    @count = 1
    @numbers = Array.new(@permutationSize)
    (@permutationSize-1).downto(0) { |j| @numbers[j] = 0}
  end

  def compute()
    visit(@numbers,0)
    @count -= 1
  end

  def visit(numberArray,k)
    @level += 1
    numberArray[k] = @level
    if (@level == @permutationSize)
      @bigbox << numberArray.dup # we pass the value,not the reference!
      @count += 1
    else
      0.upto(@permutationSize - 1) do |i|
        if (numberArray[i] == 0)
          visit(numberArray,i)
        end
      end
    end
    @level -= 1
    numberArray[k] = 0
  end
  
end

puts "Bogolomyn Permutations Computer v.1.0"
 # Permutations of numbers between 1 and 4
permutations = PermutationComputer.new(4)
puts "== START COMPUTING PERMUTATIONS =="
permutations.compute
puts "== #{permutations.count} elements found:"
permutations.bigbox.each do
  |line| puts line.inspect
end
puts "== END =="

以上内容由PHP站长网【52php.cn】收集整理供大家参考研究

如果以上内容对您有帮助，欢迎收藏、点赞、推荐、分享。

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!