public class Test3 {
public static void main(String[] args) {
// TODO Auto-generated method stub
String[] names= {"A","b","v","c","d","f","eee","ddd","hhh"};
Scanner sc =new Scanner(System.in);
System.out.println("请输入一个名字！");
String name=sc.nextLine();
sc.close();
boolean flag=false;
int i;
int n=names.length;
for( i=0;i<names.length;i++)
{
if(names[i].equals(name))
{
flag=true;
break;
}
}
if(flag)
{
System.out.println("找到了!"+names[i]+"在第"+(i+1)+"位置上。");
}
else {
System.out.println("没有找到！");
}
}
}
package javatest;
/*
* 打印10次输出
*/
public class Test {
public static void main(String[] args) {
for (int i = 0; i < 10; i++) {
//System.out.println("第"+(i+1)+"次：学习");
//System.out.printf("第%d次：读数!\n", i+1);
System.out.println(String.format("第%d次：学习", i+1));
}
}
}
package javatest;
/*
* 打印1-100之和
*/
public class TEST2 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int sum =0;
for (int i = 0; i <= 100; i++) {
sum=sum+i;
}
System.out.println(sum);
}
}
package javatest;
/*
* 斐波拉契
*/
public class Test33 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int a =1;
int b =1;
int c=0;
for(int i=3;i<=12;i++)
{
c=a+b;
a=b;
b=c;
}
System.out.println(c);
}
}
package javatest;
/*
* 斐波拉契，递归调用对计算机要求比较高，会占用更多的资源
*/
public class filbo2 {
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println(filbo(6));
}
static int filbo(int n)
{
if(n==1)
{
return 1;
}
else if(n==2)
{
return 1;
}
else {
return filbo(n-1)+filbo(n-2);
}
}
}
