2016-08-07 49 views
5

比方说,我有两个数组的子集,检查数组是另一个数组

var PlayerOne = ['B', 'C', 'A', 'D']; 
var PlayerTwo = ['D', 'C']; 

什么是检查是否arrayTwo是使用JavaScript arrayOne的子集的最佳方式?

原因:我试图理清游戏Tic tac toe的基本逻辑,并陷入中间。无论如何,这是我的代码...感谢堆!

var TicTacToe = { 


    PlayerOne: ['D','A', 'B', 'C'], 
    PlayerTwo: [], 

    WinOptions: { 
     WinOne: ['A', 'B', 'C'], 
     WinTwo: ['A', 'D', 'G'], 
     WinThree: ['G', 'H', 'I'], 
     WinFour: ['C', 'F', 'I'], 
     WinFive: ['B', 'E', 'H'], 
     WinSix: ['D', 'E', 'F'], 
     WinSeven: ['A', 'E', 'I'], 
     WinEight: ['C', 'E', 'G'] 
    }, 

    WinTicTacToe: function(){ 

    var WinOptions = this.WinOptions; 
    var PlayerOne = this.PlayerOne; 
    var PlayerTwo = this.PlayerTwo; 
    var Win = []; 

    for (var key in WinOptions) { 
     var EachWinOptions = WinOptions[key]; 

     for (var i = 0; i < EachWinOptions.length; i++) { 
      if (PlayerOne.includes(EachWinOptions[i])) { 
      (got stuck here...) 
      } 

     } 
     // if (PlayerOne.length < WinOptions[key]) { 
     // return false; 
     // } 
     // if (PlayerTwo.length < WinOptions[key]) { 
     // return false; 
     // } 
     // 
     // if (PlayerOne === WinOptions[key].sort().join()) { 
     // console.log("PlayerOne has Won!"); 
     // } 
     // if (PlayerTwo === WinOptions[key].sort().join()) { 
     // console.log("PlayerTwo has Won!"); 
     // } (tried this method but it turned out to be the wrong logic.) 
    } 
    }, 


}; 
TicTacToe.WinTicTacToe(); 
+1

[确定一个数组是否包含JavaScript/CoffeeScript中另一个数组的内容](http://stackoverflow.com/questions/15514907/determining-whether-one-array-contains-the-contents-of -another-array-in-javascri) – FrankerZ

+4

http://stackoverflow.com/questions/8628059/check-if-every-element-in-one-array-is-in-a-second-array – murli2308

+0

我会从数组中移开并仅使用字符串,比通过数组循环查找子字符串更容易找到匹配集。 ();} – Duncan

回答

8

如果您正在使用ES6:

!PlayerTwo.some(val => PlayerOne.indexOf(val) === -1); 

如果你必须使用ES5,使用填充工具为some功能Mozilla documentation,然后用正则函数的语法:

!PlayerTwo.some(function(val) { return PlayerOne.indexOf(val) === -1 }); 
6

你可以使用这段简单的代码。

PlayerOne.every(function(val) { return PlayerTwo.indexOf(val) >= 0; }) 
1

如果PlayerTwo是PlayerOne,然后组的长度的子集(PlayerOne + PlayerTwo)必须等于组的长度(PlayerOne)。

var PlayerOne = ['B', 'C', 'A', 'D']; 
var PlayerTwo = ['D', 'C']; 

// Length of set(PlayerOne + PlayerTwo) == Length of set(PlayerTwo) 

Array.from(new Set(PlayerOne)).length == Array.from(new Set(PlayerOne.concat(PlayerTwo))).length 
3

正确的解决方法是这样的:

在ES6语法:

PlayerTwo.every(val => PlayerOne.indexOf(val) >= 0); 

或ES5语法:

PlayerTwo.every(function(val) { return PlayerOne.indexOf(val) >= 0; }); 
0

这似乎是最明确的对我说:

function isSubsetOf(set, subset) { 
    for (let i = 0; i < set.length; i++) { 
     if (subset.indexOf(set[i]) == -1) { 
      return false; 
     } 
    } 
    return true; 
} 

它还有一个非成员发现的突破的优势。

相关问题