PLEASE HELP: Looking to make this code more efficient without losing functionality, just seeing if its possible, must utilize only recursion and one loop

import java.util.Scanner;

public class Assignment$2\{$

public static void main$($String$[]$ args$)\{$

System.out.println$("$Enter the number of items to read"$)$;

Scanner s$=$new Scanner$($System$.$in$)$;

int n$=$s$.$nextInt$()$;

int$[]$ a$=$new int$[$n$]$;

System.out.println$("$Enter the numbers:"$)$;

for$($int i$=0$;i$=1$ && n$2>=1)\{$

if$($h$1[$n$1-1]==$h$2[$n$2-1])\{$

f$2=$f$2+1$;

return findExact$($h$1,$h$2,$n$1-1,$h$2.$length,f$2)$;

$\}$

else $\{$

return findExact$($h$1,$h$2,$n$1,$n$2-1,$f$2)$;

$\}$

$\}$

return f$2$;

$\}$

$\}$

private static int findMirror$($int$[]$ h$1,$ int$[]$ h$2,$ int n$1,$ int n$2,$int f$1)\{$

if$($f$1==$h$1.$length$)\{$

return f$1$;

$\}$

else $\{$

if$($n$1>=1$ && n$2>=1)\{$

if$($h$1[$n$1-1]==$h$2[$n$2-$n$1])\{$

f$1=$f$1+1$;

return findMirror$($h$1,$h$2,$n$1-1,$n$2,$f$1)$;

$\}$

else $\{$

return f$1$;

$\}$

$\}$

return f$1$;

$\}$

$\}$

$\}$