上机第二次zsbd

第一题：

package test;
public class test {
	public static void main(String[] args)
	{
		softwarenumber s1=new softwarenumber();
		softwarenumber s2=new softwarenumber();
		softwarenumber s3=new softwarenumber();
		softwarenumber s4=new softwarenumber();
		softwarenumber s5=new softwarenumber();
		System.out.println("counter的大小是"+softwarenumber.counter);
	}
	
}
//另一个类
package test;

public class softwarenumber
{
	private int serianumber;
	public static int counter=0;
	public softwarenumber()
	{
		counter++;
		serianumber=counter;
	}
	public static int gettotalnumber()
	{
		return counter;
	}
	public int getserianumber()
	{
		return serianumber;
	}
	
}

第二题：

//主类
package test;
public class test {
	public static void main(String[] args)
	{
		square square1= new square();
		square1.setarea(36.0);
		square1.setlength(6.0);
		System.out.println(square1);
		System.out.println(square1.toString());
	}
	
}
//square类
package test;

public class square {
	private double edgelength;
	private double area;
	/*public square(double edgelength)
	{
		this.edgelength=edgelength;
		this.area=edgelength*edgelength;
	}*/
	public void setlength(double edgelength)
	{
		this.edgelength=edgelength;
		this.area=edgelength*edgelength;
	}
	public double getlength()
	{
		return this.edgelength;
	}
	public void setarea(double area)
	{
		this.area=area;
		this.edgelength=Math.sqrt(area);
	}
	@Override
	public String toString()
	{
		return "边长是"+edgelength+"面积是"+area;
	}
}

第三题：

//主类
package test;
public class test implements istegersequenceprocessing{
	@Override
	public boolean isarithmeticsequence(int sequence[])
	{
		if (sequence.length<=2)
		{
			return true;
		}
		int diff=sequence[1]-sequence[0];
		for(int i=2;i<sequence.length;i++)
		{
			if (sequence[i]-sequence[i-1]!=diff)
			return false;
		}
		return true;
	}
	@Override
	public boolean isgeometricsequence(int sequence[])
	{
		if (sequence.length<=2)
		{
			return true;
		}
		int ratio=sequence[1]/sequence[0];
		for(int i=2;i<sequence.length;i++)
		{
			if (sequence[i]/sequence[i-1]!=ratio)
			return false;
		}
		return true;
	}
	@Override
	public boolean isfibonaccisequence(int sequence[])
	{
		if (sequence.length<=2)
		{
			return true;
		}
		for(int i=2;i<sequence.length;i++)
		{
			if ((sequence[i-2]+sequence[i-1])!=sequence[i])
			return false;
		}
		return true;
	}
	
	public static void main(String[] args)
	{
		int [] dengcha= {1,3,5,7};
		int [] dengbi= {1,2,4,8};
		int [] feibo= {1,3,4,7,11};
		int [] xiaxie= {1,9,11,23};
		test ans=new test();
		System.out.println("等差？"+ans.isarithmeticsequence(dengcha));
		System.out.println("等比？"+ans.isgeometricsequence(dengbi));
		System.out.println("斐波那契？"+ans.isfibonaccisequence(feibo));
		System.out.println("等差？"+ans.isarithmeticsequence(xiaxie));
	}
	
}
//接口
package test;

public interface istegersequenceprocessing {
	public boolean isarithmeticsequence(int sequence[]);
	public boolean isgeometricsequence(int sequence[]);
	public boolean isfibonaccisequence(int sequence[]);
}

第四题：

//主类
package test;
public class test{
	
	public static void main(String[] args)
	{
		iterationcomputation ans=new iterationcomputation();
		float answer=ans.iterationmethodofnewton((float)4.0,(float) 2.0, (float)0.001);
		System.out.println(answer);
	}
	
}
//其他类
package test;

public class iterationcomputation {
	public float  iterationmethodofnewton (float a,float x0,float z)
	{
		float last=x0;
		float tmp=(last+a/last)/2;
		while (Math.abs(tmp-last)>=z)
		{
			last=tmp;
			tmp=(last+a/last)/2;
		}
		return tmp;
	}
}