# -*- coding:utf-8 -*-
# python 實(shí)現(xiàn)N個(gè)數(shù)組的排列組合(笛卡爾積算法)
class Cartesian():
  # 初始化
  def __init__(self, datagroup):
    self.datagroup = datagroup
    # 二維數(shù)組從后往前下標(biāo)值
    self.counterIndex = len(datagroup)-1
    # 每次輸出數(shù)組數(shù)值的下標(biāo)值數(shù)組(初始化為0)
    self.counter = [0 for i in range(0, len(self.datagroup))]
  # 計(jì)算數(shù)組長度
  def countlength(self):
    i = 0
    length = 1
    while(i < len(self.datagroup)):
      length *= len(self.datagroup[i])
      i += 1
    return length
  # 遞歸處理輸出下標(biāo)
  def handle(self):
    # 定位輸出下標(biāo)數(shù)組開始從最后一位遞增
    self.counter[self.counterIndex]+=1
    # 判斷定位數(shù)組最后一位是否超過長度，超過長度，第一次最后一位已遍歷結(jié)束
    if self.counter[self.counterIndex] >= len(self.datagroup[self.counterIndex]):
      # 重置末位下標(biāo)
      self.counter[self.counterIndex] = 0
      # 標(biāo)記counter中前一位
      self.counterIndex -= 1
      # 當(dāng)標(biāo)記位大于等于0，遞歸調(diào)用
      if self.counterIndex >= 0:
        self.handle()
      # 重置標(biāo)記
      self.counterIndex = len(self.datagroup)-1
  # 排列組合輸出
  def assemble(self):
    length = self.countlength()
    i = 0
    while(i < length):
      attrlist = []
      j = 0
      while(j<len(self.datagroup)):
        attrlist.append(self.datagroup[j][self.counter[j]])
        j += 1
      print attrlist
      self.handle()
      i += 1

if __name__ == "__main__":
  # 構(gòu)造二維數(shù)組
  datagroup = [['aa1', ], ['bb1', 'bb2'], ['cc1', 'cc2', 'cc3']]
  # 創(chuàng)建cartesian對象
  cartesian = Cartesian(datagroup)
  cartesian.assemble()