Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static boolean findeSubarray2( int[] werte, int[] subarray){
- if(werte.length<subarray.length)return false;
- int c=0;
- for(int k=0; k<=werte.length-subarray.length;k++){
- c=0;
- for( int j =0; j<subarray.length; j++){
- if(werte[k+j]==subarray[j]){
- c++;
- if(c==subarray.length) return true;
- }
- else break;
- }
- }
- return false;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement