boolean comArr(String [] sa1, String [] sa2)
{
if (sa1.length != sa2.length) return false;
for (int n=0; n<sa1.length; ++n)
{
if ( ! sa1[n].equals(sa2[n]) ) return false;
}
return true;
}
[update]
In order to check if an array contains the other, you might use:
(Please note you have to use
split(", ")
, in your original code)
public static boolean comArr(String [] sa1, String [] sa2)
{
String [] bigger;
String [] smaller;
if (sa1.length < sa2.length)
{
bigger = sa2;
smaller = sa1;
}
else
{
bigger = sa1;
smaller = sa2;
}
int d = bigger.length - smaller.length;
for (int offset = 0; offset <= d; ++offset)
{
int n;
for (n=0; n<smaller.length; ++n)
{
if ( !smaller[n].equals(bigger[offset+n])) break;
}
if ( n == smaller.length) return true;
}
return false;
}
[/update]