比较阵列元件

Question

2 arraya即item和tra

item包含

B 
C 
M 
G 
D 
E 

tra数组包含

BM 
BDGE 
MDGC 
BMDG 
BMDC 

我需要找到每个元素的计数在item阵列存在于tra阵列

例如B计数是4 C计数是2

对于此任务我利用了count()和计数器变量。

这里是我的代码

using System; 
using System.Collections.Generic; 
using System.Linq; 
using System.Text; 

namespace apriori 
{ 
    class apriori 
    { 
     static void Main(string[] args) 
     { 
      int t, n, s, i, j, k, q; 
      int counter = 0; 
      int[] count = new int[6]; 

      Console.WriteLine("enter the number of transactions t"); 

      t = Convert.ToInt32(Console.ReadLine()); 

      Console.WriteLine("enter the number of items n"); 

      n = Convert.ToInt32(Console.ReadLine()); 

      Console.WriteLine("enter minimum support s"); 

      s = Convert.ToInt32(Console.ReadLine()); 

      String[] tra = new String[t]; 
      String[] item = new String[n]; 

      Console.WriteLine("enter transactions representing one alphabet each item"); 

      for (i = 0; i < t; i++) 
      { 
       tra[i] = Console.ReadLine(); 
      } 

      Console.WriteLine("list of transactions"); 

      foreach (String it in tra) 
      { 
       Console.WriteLine(it); 
      } 

      Console.WriteLine("enter items"); 

      for (j = 0; j < n; j++) 
      { 
       item[j] = Console.ReadLine(); 
      } 

      Console.WriteLine("list of items"); 

      foreach (String ite in item) 
      { 
       Console.WriteLine(ite); 
      } 

      for (i = 0; i < n; i++) 
      { 
       for (j = 0; j < t; j++) 
       { 
        if (item[i]==tra[j]) 
        { 
         count[i]=counter++; 
        } 
       } 

       counter=0; 
      } 

Answer 1

你的程序将不会为n>6工作，如：

int[] count = new int[6]; 

for (i = 0; i < n; i++) 
{ 
     for (j = 0; j < t; j++) 
     { 
      if (item[i]==tra[j]) 
      { 
       // this index is out of bounds when i>=6 
       count[i]=counter++; 
      } 
     } 

     counter=0; 
}