Friday, February 24, 2012
ArrayinArray
public class ArraySort {
public static void main(String []args)
{
int length = 9999;
int search[]={0,0,0,0};
int pattern[]= {1,3,2,4};
int data[]= {62,58,3,15,6,5,60,1,7,8,22,3,9,4,1,2,9,7,35,4,2,8,80,6,5,3,73,6,1};
for ( int i=0; i<data.length; i++ )
{
if ( data[i] == pattern[0] || data[i] == pattern[1] || data[i] == pattern[2] || data[i] == pattern[3] )
{
for(int k=0; k<4; k++)
{
search[k]=0;
}
for(int j=i; j<data.length; j++)
{
if ( data[j] == pattern[0] )
search[0]=1;
if ( data[j] == pattern[1] )
search[1]=1;
if ( data[j] == pattern[2] )
search[2]=1;
if ( data[j] == pattern[3] )
search[3]=1;
if (search[0] == 1 && search[1] == 1 && search[2] == 1 && search[3] == 1)
{
if (length > j-i+1)
{
length=j-i+1;
break;
}
}
}
}
}
System.out.println ("The Smallest length for the pattern is :"+length);
}
}
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment