这是一款井字游戏应用的尝试。我有两个数组playerMoves和winningCombinations。像这样。varplayerMoves=[0,1,4];varwinningCombinations=[[0,1,2],[3,4,5],[6,7,8],[0,3,6],[1,4,7],[2,5,8],[0,4,8],[2,4,6]];我需要过滤winningCombination数组，使playerMoves数组的至少两个值与winningCombination中的每个数组匹配>。findPossibleMove(playerMoves);//shouldreturn[[0,1,2],