全組合的遞迴實現（ruby）

標籤：start   puts   pre   nod   blog   node   for   color   tar   

著急用所以直接扒了一個C++演算法翻譯成了ruby…暫記

 1 nodes = ["node1", "node2", "node3", "node4", "node5", "node6"] 2  3 def combine_array(arr, start, index, count, num ,len, output)          4     for i in (start..len-1) 5       index[count-1] = i 6       if count-1 == 0 then 7         out = [] 8         for j in (0..num-1)        9         out << arr[index[j]]                     10         end11         #puts "#{out}"12         #puts "------------"13         output << out14       else15         combine_array(arr, i+1, index, count-1, num, len, output)16       end17    end18 end19 20 for i in (1..6)21   outs = []22   combine_array(nodes, 0, index, i, i, len, outs)23   p outs24   puts "------------"25 end

 

全組合的遞迴實現（ruby）