find covering prefix

[Angus Ferguson]

Hi

I am trying to find a covering prefix

my code is:

 int[] A = new int[7];
        A[0] = 1;
        A[1] = 2;
        A[2] = 1;
        A[3] = 2;
        A[4] = 3;
        A[5] = 2;
        A[6] = 0;

        ps(A, A.length-1);
    }

   static  int  ps ( int A[], int N ) {
    int u=0;
     boolean encontado=false;
       int [] acum=new int[1];
        for (int i = 0; i < A.length; i++) {
            int j = A[i];
            for (int k = 0; k < acum.length; k++) {
                int l = acum[k];
               
                if(j==l){
                encontado=true;
              
                }
                if(!encontado){

                    acum[k]=//here is the problem how could I add a new value dinamically?
                    acum[k]=j;

                }

                   
                
            }

Thanks

[Ulf Dittmer]

What do you mean by "adding a new value dynamically"? Do you mean to increase the array's length? If so, then that can't be done. You could use a List<Integer> instead of an int[] - that can be extended dynamically.

[Winston Gutkowski]

Angus Ferguson wrote:I am trying to find a covering prefix...

Well, first: you need to define what a "covering prefix" is (I had to look it up); because it will be different for an int[] than it is for a String[] (at least the way of calculating it will be very different). Furthermore, it's quite possible that there are types for which it is simply not applicable ('can't think of one, based on what I've read; but it's worth thinking about).

However, for an int[], it would appear to be a byproduct of the max() function; so you might want to look at Math.max().

Winston