Find in mountain arrray #leetcode

public class practice_2 { public static void main(String[] args) { int[] arr = {1,2,3,4,5,3,1}; int target = 3; int search = searching(arr); int check = asscen(arr,search,target); int check2 = descen(arr,search+1,arr.length-1,target); if(check!=-1){ ...