zoukankan      html  css  js  c++  java
  • 第十三次作业

    package PJH;
    
    public class feiponaqi {
        public static void main(String[] args) {
            int[] arr = new int [30];
            arr[0] = 1;
            arr[1] = 1;
            for(int i = 2;i < arr.length;i++)
                arr[i] = arr[i-1] + arr[i-2];
            for(int i : arr)
                System.out.println(i);
        }
    
    }

    package PJH;
    
    public class xuanze {
             public static void main(String[] args) { 
            int[] arr={1,3,2,45,65,33,12}; 
            System.out.println("交换之前:");
            for(int num:arr){ 
            System.out.print(num+" "); 
            } 
            for(
            int i = 0; i < arr.length - 1; i++) {
            int k = i; 
            for(int j = k + 1; j < arr.length; j++){
            if(arr[j] < arr[k]){  
                     k = j; 
                        } 
                    } 
            if(i != k){  
            int temp = arr[i]; 
                    arr[i] = arr[k]; 
                    arr[k] = temp; 
                    } 
            } 
    
            System.out.println();
            System.out.println("交换后:"); 
            for(int num:arr){
            System.out.print(num+" "); 
            } 
            } 
            }

    package PJH;
    
    public class maopao {
        public static void main(String[] args) 
        { int[] arr={12,45,23,67,56,34,99,123}; 
        System.out.println("排序前数组为:"); 
        for(int num:arr)
        { 
        System.out.print(num+" "); 
        } 
        for(int i=0;i<arr.length-1;i++){
        for(int j=0;j<arr.length-1-i;j++){
        if(arr[j]>arr[j+1]){ 
        int temp=arr[j]; 
        arr[j]=arr[j+1]; 
        arr[j+1]=temp; 
        } 
        } 
        } 
        System.out.println(); 
        System.out.println("排序后的数组为:"); 
        for(int num:arr){ 
        System.out.print(num+" "); 
        } 
        } 
    }

    package PJH;
    
    public class PersonArray {
        public static void main(String args[])
        {
            person per[]=new person[3];
            per[0]=new person("张三",20);
            per[1]=new person("李四",22);
            per[2]=new person("王五",23);
            for (int x=0;x<per.length;x++)
            {
                per[x].getinfo();
            }
        }
    }
    class person
    {
        private String name;
        private int age;
        public person(String name,int age)
        {
            this.name=name;
            this.age=age;
        }
        public void getinfo()
        {
            System.out.println("姓名: "+this.name+" 年龄: "+this.age);
        }
    }

  • 相关阅读:
    HDU 4825 字典树
    HDU4287 字典树
    HDU 3973 AC's String 字符串哈希
    HDU5296 Annoying problem(LCA)
    Gym 100712L Alternating Strings II(单调队列)
    数据结构专题
    HDU5033 Building(单调栈)
    HDU2888 Check Corners(二维RMQ)
    HDU 4123 Bob’s Race(RMQ)
    HDU3530 Subsequence(单调队列)
  • 原文地址:https://www.cnblogs.com/520peng/p/8058339.html
Copyright © 2011-2022 走看看