本文介绍了找出数组之间的差异的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
大家好, 我有这样一个数组:
Hi all, I have an array like this:
1 1 -1 -1 0 0 1 1 -1 0 -1 0 1 1 0 -1 -1 0 0 0 -1 -1 1 1......(所有排列) 我需要找到那些必须在这个数组上的数组之间的最大差异数。 例如:
...(all permutations) I need to find maximum number of difference between those arrays which result must be on this arrays. e.g.:
1 1 -1 -1 0 0 (1) 1 1 0 0 -1 -1 (2) 1 0 -1 0 1 -1 (3)
(1) - (2) = 0 0 -1 -1 1 1 which is in first array. (1) - (3) = 0 1 0 -1 -1 1 which also is part of the first arrays.
现在我需要检查一下(2) - (3)达到这个条件。 怎么样? 代码块添加 - OriginalGriff [/ edit]
Now I need to check if (2) - (3) achieve this condition. How? [edit]Code block added - OriginalGriff[/edit]
推荐答案您能否发送您的代码和确切的问题影响区域? Could you please send your code and exactly problem affected area?
更多推荐
找出数组之间的差异
发布评论