在一个排序数组里面找出所有和为m的组合

package hualugu_6

public class find{

public static void main(String [] args){

int[] group={1, 5, 10, 11 , 13, 18, 22 ,55};

int out=23;

int start=0;

int end=group.length-1;

if(group[start]>=out)

{

System.out.println("Not Find!");

return;

}

while(end>start){

if(group[start]+group[end]==out){

System.out.println(group[start]+"+"+group[end]+"符合要求");

start++;

end--;

}

else if(group[start]+group[end]>out){

end--;

}

esle if(group[start]+group[end]<out){

start++;

}

}

}

}