字符串中的每个字符在另一个字符串中以任意顺序存在

尝试以下操作:

rooms = { "n", "s", "e", "w", "nw", "ns", "ne", "sw", "se", "ew", "nsw", "nse", "swe", "nwe", "nsew" }

function normalize(s)
    local t=""
    if s:match("n") then t=t.."n"..".*" end
    if s:match("s") then t=t.."s"..".*" end
    if s:match("e") then t=t.."e"..".*" end
    if s:match("w") then t=t.."w" end
    return t
end

p = normalize("es")

for i,v in ipairs(rooms) do
    if v:match(p) then print(v) end
end

我试图找到任何字母组合的解决方案,但每个字母都必须出现在样本中:

local rooms = { "n", "s", "e", "w", "nw", "ns", "ne", "sw", "se", "ew", "nsw", "nse", "swe", "nwe", "nsew" }

function MyFind (inp, str)
      if str=="" then return false end
      local found=true
      string.gsub(str, '.', function (c)  -- this code can be replaced with a 'for' loop
            if inp:find(c) and found then found=true else  found=false end
          end)
      return found ,inp  
 end

local chars = "se"    -- 1,2,3.. or more letters
for _,v in pairs(rooms) do
      a,b = MyFind (v, chars)
      if a then print (b) end
end

打印:

se
nse
swe
nsew