【发布时间】:2017-03-21 22:22:13
【问题描述】:
考虑矩阵:
badcombos
[,1] [,2]
[1,] "Red" "Yellow"
[2,] "Green" "Yellow"
[3,] "Orange" "Yellow"
[4,] "Blue" "Green"
[5,] "Blue" "Purple"
然后,列表:
allcombos
[[1]]
[1] "Red" "Green" "Orange" "Pink" "Purple"
[[2]]
[1] "Red" "Red" "Brown" "Purple" "Pink"
[[3]]
[1] "Yellow" "Red" "Brown" "Blue" "Purple"
[[4]]
[1] "Yellow" "Green" "Blue" "Purple" "Gold"
....
[[k]] "Red" "Blue" "Orange" "Brown" "Pink
如果 badcombos 矩阵中的任何颜色组合出现在列表中(即上例中的子列表 [[3]] 和 [[4]]),我将如何“减少”列表然后他们将从列表中删除。
编辑 - 完整代码:
my_list = list()
my_list[[1]] = c("Red","Green","Orange","Pink","Purple")
my_list[[2]] = c("Red","Red","Brown","Purple","Pink")
my_list[[3]] = c("Yellow","Red","Brown","Blue","Purple")
my_list[[4]] = c("Yellow","Green","Blue","Purple","Gold")
my_list[[5]] = c("Red","Blue","Orange","Brown","Pink")
my_matrix = t(matrix(c("Red","Yellow","Green","Yellow","Orange","Yellow","Blue","Green","Blue","Purple"),2,5))
【问题讨论】:
-
请使用
dput提供badcombos和allcombos。 (即编辑您的帖子并添加dput(badcombos)和dput(allcombos)的结果。 -
我只把它们作为理论向量和矩阵,因为我使用的要复杂得多。
-
@Aesler ,Luke 打算将 dput 作为示例发布,以便我们更轻松地解决问题。否则,我们必须创建对象。
-
好的,我只是用完整的代码快速编辑了它:)