3、非递归
import java.io.*;
public class Fibonacci
{
public static void main(String []args)
{
int n=10;
int i=0;
int []a=new int[n];
for(i=0;i<n;i++)
a[i]=1;
if(n>2)
{
for(i=2;i<n;i++)
a[i]=a[i-1]+a[i-2];
}
for(i=0;i<n;i++)
System.out.print(" "+a[i]);
System.out.println();
}
}
4、
import java.io.*;
public class Test
{
public static int qiuzhi(int a,int b,char c)
{
int result=0;
switch(c)
{
case '+':
result=a+b;
break;
case '-':
result=a-b;
break;
case '*':
result=a*b;
break;
case '/':
result=a/b;
break;
}
return result;
}
public static void main(String []args)
{
int a=3,b=3;
char c='+';
int result=qiuzhi(a,b,c);
System.out.println(result);
}
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO 自动生成方法存根
int[] arr = new int[]{3,15,2,45,1};
int min = arr[0];
int max = arr[0];
for(int i = 1;i < arr.length;i++){
if(max < arr[i]) max = arr[i];
if(min> arr[i]) min = arr[i];
}