排列组合:01转换法之lua实现

c++ 版连接 https://blog.csdn.net/canguanxihu/article/details/46363375

因为项目用的是lua脚本，看了C++版后自己写了一个lua版本的，原理在c++连接里面博主已经介绍了，我也不重复描述了，直接把代码贴出来

 local NewLogic = class("NewLogic")

 local handCardCount = 

 --随机生成扑克用于测试
 function NewLogic:randomMakeCards()

     math.randomseed(os.time())

     local cards = {}

     repeat
         local card = math.random()
         if not table.indexof(cards,card) then
             table.insert(cards,card)
         end
     until(#cards == handCardCount)

     return cards
 end

 -- o 1 转换排列组合法
 function NewLogic:combination(cards,cbntNumber)
     if cbntNumber > #cards then
         return nil
     end

     local assistArray = {}
     for i = ,#cards do
         if i <= cbntNumber then
             assistArray[i] =
         else
             assistArray[i] =
         end
     end

     local cbntResult = {}

     local function getResult(astArray,srcArray,cbntResult)
         local oneOfCombination = {}
         for k,v in ipairs(astArray) do
             if v ==  then
                 table.insert(oneOfCombination,srcArray[k])
             end
         end

         table.insert(cbntResult,oneOfCombination)
     end

     getResult(assistArray,cards,cbntResult)

     local idx =
     while true do
         if assistArray[idx + ] == nil then
             break
         end

         if assistArray[idx] ==  and assistArray[idx + ] ==  then
             assistArray[idx] =
             assistArray[idx + ] = 1
             for i =  , idx - do
                 for j = i + , idx do
                     if assistArray[i] < assistArray[j] then
                         local mid = assistArray[i]
                         assistArray[i] = assistArray[j]
                         assistArray[j] = mid
                     end
                 end
             end
　　　　　　　　　getResult(assistArray,cards,cbntResult)
             idx =
         else
             idx = idx +
         end
     end

     return cbntResult
 end

 return NewLogic