Кухня(); Задание N64

public static List<int[]> getAjkInB(int[] a, int[] b) {
        List<int[]> list = new LinkedList<int[]>();
        int n = 0, k = a.length;
        while(n + 1 < k) {           // n + 1 нам не надо искать 1 элемент
            for (int i = 0; i < b.length - (k - 1 - n); i++) {
                int[] temp = Arrays.copyOfRange(a, n, k);
                if(Arrays.equals(temp, Arrays.copyOfRange(b, i, (k - n + i))))
                    list.add(temp);                
            }
            if(n + 1 == --k) {       // n + 1 нам не надо искать 1 элемент
                n++;
                k = a.length;
            }
        }
        return list;
    }

public static boolean checkSequence(int[] arr, int[] arr2, int k)
    {
        boolean result = false;
        int count = 0;

        if (arr.length == 0 || arr2.length == 0 )
            throw new IllegalArgumentException("Bad args");


        for (int i = 0; i < arr.length; i++)
        {
            for (int y : arr2)
                if (arr[i] == y)
                {
                    count++;
                    i++;                    
                    if (count == k)
                    {
                        result = true;
                        break;
                    }
                }
            count = 0;
        }
        return result;
    }

public static Boolean isTrueIfContains(int[] arr1, int[] arr2)
    {
        String s1 = "";

        for(Integer x : arr1)
            s1 += Integer.toString(x);

        String s2 = "";

        for(Integer x : arr2)
            s2 += Integer.toString(x);

        return s1.contains(s2);
    }