title: Find non-duplicate items between two arrays with Java
body: <p>I have the following task: 
  There are 2 one dimensional arrays of integers between -20000000 and 20000000. Some of the numbers that are contained in the first array are also contained in the second array. I have to find all the numbers that are contained in the first array but are not contained in the second array. i have to use Java as a language</p>
  
  <p>Here are the arrays</p>
  
  <p>[1, 652 ,5, 15, 385, 4 , 55, 666, 13] </p>
  
  <p>[2, 4658, 9, 55, -588, 10, 1083, 17]</p>
  
  <p>Any Ideas how to find it ?</p>
  
  <p>EDIT:</p>
  
  <p>Here is the final code:</p>
  
  <pre><code>import java.util.ArrayList;
  import java.util.List;
  public class Values {
  public static void main (String[] argv) {
  
  int[] Array1 = new int[] {1,652,5,15,385,4,55,666,13};
  int[] Array2 = new int[] {2, 4658, 9, 55, -588, 10, 1083, 17};
  int calculateResult = 0;
  boolean contains = false;
  int mod = 123456789; 
  int modSum = 0;
  
  List&lt;Integer&gt; results = new ArrayList&lt;Integer&gt;();
      for(int i=0; i&lt;Array1.length; i++) {
          for(int j=0; j&lt;Array2.length; j++) {
              if(Array1[i]==Array2[j]) {
                  contains = true;
                  break;
              }
          }
          if(!contains) {
              results.add(Array1[i]);
          }
          else {
              contains = false;
          }
      }
      // calculate the result
      for (int i : results) {
          calculateResult  += i;
      }
      // Print Results
      System.out.println(results);
      System.out.println(calculateResult);
  }}
  </code></pre>
  
  <p>Now I'm trying to load Arrays from .csv file. Any ideas ?</p>