//这个类各位可以先忽略不看
import java.util.*;
public class Circle implements Comparable
{
int radius = 0;
public Circle(int radius)
{
this.radius = radius;
}
public int compareTo(Object obj)
{
int radius = ((Circle)obj).radius;
if (radius>this.radius)
return -1;
else if (radius<this.radius)
return 1;
else
return 0;
}
public String toString()
{
return ""+this.radius;
}
public static void main(String[] args)
{
Circle[] circle = {new Circle(2),new Circle(10),new Circle(8),new Circle(4),new Circle(12)};
Arrays.sort(circle);
System.out.println("排序后:"+Arrays.toString(circle));
}
}///////////////////////////////////////////////////////////////
import java.util.*;
public class ArraySearch
{
public static void main(String[] args)
{
int loc;
Circle[] circle = {new Circle(2),new Circle(10),new Circle(8),new Circle(4),new Circle(12)};
Arrays.sort(circle);
//排序完之后我想查找circle数组中radius中值为7和9的对象,该如何实现呢,还望各位大哥赐教
}
}
import java.util.*;
public class Circle implements Comparable
{
int radius = 0;
public Circle(int radius)
{
this.radius = radius;
}
public int compareTo(Object obj)
{
int radius = ((Circle)obj).radius;
if (radius>this.radius)
return -1;
else if (radius<this.radius)
return 1;
else
return 0;
}
public String toString()
{
return ""+this.radius;
}
public static void main(String[] args)
{
Circle[] circle = {new Circle(2),new Circle(10),new Circle(8),new Circle(4),new Circle(12)};
Arrays.sort(circle);
System.out.println("排序后:"+Arrays.toString(circle));
}
}///////////////////////////////////////////////////////////////
import java.util.*;
public class ArraySearch
{
public static void main(String[] args)
{
int loc;
Circle[] circle = {new Circle(2),new Circle(10),new Circle(8),new Circle(4),new Circle(12)};
Arrays.sort(circle);
//排序完之后我想查找circle数组中radius中值为7和9的对象,该如何实现呢,还望各位大哥赐教
}
}
for(int i=0;i<circle.length;i++)
{
if(circle[i].toString().equals("7"))
{
System.out.println("找到radius为7的");
}
else if(circle[i].toString().equals("9"))
{
System.out.println("找到radius为9的");
}
}
我觉得用二分法未必对lz的这种情况适合,因为半径为9,为7的就只有一个
那就是这样子了
这样看看了
如果有,则会返回相应位置的
//index是排序后new Circle(7)在数组circle中的下标
if(index>=0)
{
System.out.println("找到了"+new Circle(7));
}
else System.out.println("没有找到"+new Circle(7));
这样看看了
如果有,则会返回相应位置的到这里你都不知道怎么做,只能说明你太弱智!