我有两个数组,我想检查是否所有元素arr2都在arr1.如果重复元素的值arr2,则它需要arr1具有相同的次数.这样做的最佳方法是什么?
arr1 = [1, 2, 3, 4]
arr2 = [1, 2]
checkSuperbag(arr1, arr2)
> true //both 1 and 2 are in arr1
arr1 = [1, 2, 3, 4]
arr2 = [1, 2, 5]
checkSuperbag(arr1, arr2)
> false //5 is not in arr1
arr1 = [1, 2, 3]
arr2 = [1, 2, 3, 3]
checkSuperbag(arr1, arr2)
> false //3 is not in arr1 twice
Run Code Online (Sandbox Code Playgroud) 假设我有两个数组,
var PlayerOne = ['B', 'C', 'A', 'D'];
var PlayerTwo = ['D', 'C'];
Run Code Online (Sandbox Code Playgroud)
使用javascript检查arrayTwo是否是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 = []; …Run Code Online (Sandbox Code Playgroud) 目标阵列 [1,2,3]
array1 = [1,2,3]; //return true
array2 = [1,2,3,4]; //return true
array3 = [1,2] //return false
Run Code Online (Sandbox Code Playgroud)
我不知道如何实现这一目标,或者可能需要在其中使用自定义登录。我已经使用了一些内容,但包含的内容对我不起作用。