关键概念

无序

不重复

并集、交集

定义

跟高中的集合概念一模一样

交并补集

代码实现

  1. function cusSet() {
  2.     this.dataStore = []
  3.     this.add = add
  4.     this.contains = contains
  5.     this.delete = del
  6.     this.show = show
  7.     this.size = size
  8.     this.union = union
  9.     this.intersection = intersection
  10.     this.complementary = complementary
  11.     this.hasSubSet = hasSubSet
  12. }
  14. function add (el) {
  15.     if (!this.contains(el)) {
  16.         this.dataStore.push(el)
  17.     }
  18. }
  19. function contains (el) {
  20.     if (this.dataStore.indexOf(el) > -1) {
  21.         return true
  22.     } 
  23.     return false
  24. }
  25. function del (el) {
  26.     // if (!this.contains(el)) return false
  27.     var pos = this.dataStore.indexOf(el) 
  28.     if (pos > -1) {
  29.         this.dataStore.splice(pos, 1)
  30.         return true
  31.     }
  32.     return false
  33. }
  34. function show () {
  35.     return this.dataStore
  36. }
  37. function size () {
  38.     return this.dataStore.length
  39. }
  41. // 开始实现  交并补
  42. function union (set) {
  43.     // 并集
  44.     var tempSet = new cusSet()
  45.     for (var i = 0; i < set.size(); i++) {
  46.         tempSet.add(set.dataStore[i])
  47.     }
  48.     for (var n = 0; n < this.size(); n++) {
  49.         tempSet.add(this.dataStore[n])
  50.     }
  51.     return tempSet
  52. }
  53. function intersection (set) {
  54.     // 交集
  55.     var tempSet = new cusSet()
  56.     for (i = 0; i < set.size(); i++) {
  57.         if (this.contains(set.dataStore[i])) {
  58.             tempSet.add(set.dataStore[i])
  59.         }
  60.     }
  61.     return tempSet
  62. }
  63. function complementary (set) {
  64.     // 补集
  65.     var tempSet = new cusSet()
  66.     for (i = 0; i < set.size(); i++) {
  67.         if (!this.contains(set.dataStore[i])) {
  68.             tempSet.add(set.dataStore[i])
  69.         }
  70.     }
  71.     return tempSet
  72. }
  73. // 判断子集
  74. function hasSubSet(set) {
  75.     if (set.size() > this.size()) return false
  76.     for (i = 0; i < set.size(); i++) {
  77.         if (!this.contains(set.dataStore[i])) {
  78.             return false
  79.         }
  80.     }
  81.     return true
  82. }
  83. var class1 = new cusSet()
  84. class1.add('小明')
  85. class1.add('小张')
  86. class1.add('小红')
  87. class1.add('jacky')
  89. var class2 = new cusSet()
  91. class2.add('小红')
  92. // class2.add('小绿')
  93. class2.add('jacky')
  94. class2.add('jacky2')
  95. class2.add('jacky3')
  96. class2.add('jacky4')
  97. class2.add('jacky5')
  98. class2.add('jacky6')
  101. console.log((class1.intersection(class2)).show())
  102. console.log((class1.union(class2)).show())
  103. console.log((class1.complementary(class2)).show())
  104. console.log(class1.hasSubSet(class2))