packagecom.mingrui.soft_struct;
publicclassRadarPoint{ publicstaticvoid main(String [] args){ double [][] point={{3,2},{5,4},{1,0},{4,1}}; operFunc(point); } //操作方法 publicstaticvoidoperFunc(double[][] point){ int line=point.length; //int row=2; doublelengthPos[][]=newdouble[line][4]; doublelengthPosAFinal[]=newdouble[line]; for(inti=0;i
——"+lengthPos[i][0]+","+lengthPos[i][1]+ "的长度是"+lengthPos[i][2]+" 其位置是"+(int)lengthPos[i][3]); } } //计算距离方法 publicstaticdoublepointLength(doublepos[][],int p){ return
Math.sqrt((Math.abs(pos[p][0]))*(Math.abs(pos[p][0]))+(Math.abs(pos[p][1]))*(Math.abs(pos[p][1]))); } //排序方法,将对应点对应承相应的排位 publicstaticdouble[][] insertSort(double[][] point,doublelengthPos[]){ doubletmpLength=0; inttmpPos=0; double [][] gradeLength=newdouble [point.length][4]; for(inti=0;i0;k--){ if(lengthPos[k] }
} for(int i1=0;i1 //解析输入方法
publicstaticvoidinputParseToPoint(String str){ }