實(shí)驗(yàn)四-面向?qū)ο蟾呒?jí)技術(shù)

1、精選優(yōu)質(zhì)文檔-傾情為你奉上實(shí)驗(yàn)四一、有一個(gè)abstract類，類名為Employee，其子類有YearWorker、MonthWorker、WeekWorker。YearWorker對(duì)象按年領(lǐng)取薪水，MonthWorker按月領(lǐng)取薪水、WeekWorker按周領(lǐng)取薪水。Employee類有一個(gè)abstract方法：public abstract earnings（）；子類必須重寫(xiě)父類的earnings（）方法，給出各自領(lǐng)取報(bào)酬的具體方式。    有一個(gè)Company類，該類用Employee數(shù)組作為成員，Employee數(shù)組的單元可以是YearWorker對(duì)象的上

2、轉(zhuǎn)型對(duì)象、MonthWorker對(duì)象的上轉(zhuǎn)型對(duì)象或WeekWorker對(duì)象的上轉(zhuǎn)型對(duì)象。程序能輸出Company對(duì)象一年需要支付的薪水總額。    程序模板           按模板要求，將代碼處替換為Java程序代碼。     HardWork.java    abstract class Employee    public abstract double earning

3、s();class YearWorker extends Employee    代碼1 /重寫(xiě)earnings（）方法class MonthWorker extends Employee    代碼2 /重寫(xiě)earnings（）方法class WeekWorker extends Employee    代碼3 /重寫(xiě)earnings（）方法class Company    Employee employee;   double salarie

4、s=0;   Company(Employee employee)       this.employee=employee;      public double salariesPay()       salaries=0;      代碼4 /計(jì)算salaries     

5、 return salaries;   public class HardWork    public static void main(String args)       Employee employee=new Employee20;      for(int i=0;i<employee.length;i+)        

6、;  if(i%3=0)         employeei=new WeekWorker();         else if(i%3=1)         employeei=new MonthWorker();        

7、; else if(i%3=2)         employeei=new YearWorker();            Company company=new Company(employee);      System.out.println("公司年工資總額："+company.sala

8、riesPay();    二、運(yùn)行下面的程序，理解成員變量的繼承與隱藏。 import java.io.*; class sum_3            int sum,num1,num2;            static int num3;      

9、;      /定義構(gòu)造函數(shù)初始化對(duì)象     sum_3()                   num1=0;                  

10、 num2=0;                   num3=0;                   sum=0;          &

11、#160;   class sub_sum3 extends sum_3            int sum,num1,num2;        /隱藏父類sum_3中的實(shí)例變量            static int num3;    

12、60;           /隱藏父類sum_3中的類變量               void sum(int i,int j,int k)                  

13、num1=i;                   num2=j;                   num3=k;          &

14、#160;        sum=num1+num2+num3;              public class computing     public static void main (String arg)           sub_sum3 m

15、1=new sub_sum3();        m1.sum(100,200,300);        System.out.println("sum="+m1.num1+"+"+m1.num2+"+"+m1.num3+"="+m1.sum);          三、運(yùn)行下面的程序，理解

16、方法的繼承。 class Sort3            double max1,max2,max3;            Sort3()                   max1=

17、-1;                   max2=-1;                   max3=-1;          

18、60;  void sort()                   double s;                   if (max1<max2) s=max1;max1=max2;max2=s; 

19、;                   if (max1<max3) s=max1;max1=max3;max3=s;                    if (max2<max3) s=max

20、2;max2=max3;max3=s;                class sub_Sort3 extends Sort3            void subsort(double i,double j,double k)         

21、          max1=i;                   max2=j;                   max3=k; 

22、               sort();  /調(diào)用父類中的方法sort()              public class Class1              

23、0;  public static void main (String args)              sub_Sort3 m1 = new sub_Sort3();                    m1.subsort(100,200,300); 

24、;                 System.out.println("三個(gè)數(shù)從大到小為："+m1.max1+","+m1.max2+","+m1.max3);                   

25、;四、運(yùn)行下面的程序，理解方法的重載。 class Sort2or3          double max1,max2,max3;         Sort2or3()                   max1=-1; &#

26、160;                  max2=-1;                   max3=-1;            &

27、#160;           void sort(double i,double j)                   double s;              

28、0;    max1=i;                   max2=j;                   if(max1<max2) s=max1;max1=max2;max2=s;&

29、#160;                        void sort(double i,double j,double k)                   double s; 

30、                  max1=i;                   max2=j;            &#

31、160;      max3=k;                   if (max1<max2) s=max1;max1=max2;max2=s;                 

32、   if (max1<max3) s=max1;max1=max3;max3=s;                    if (max2<max3) s=max2;max2=max3;max3=s;              

33、; public class Class1            public static void main (String args)                 Sort2or3 m1 = new Sort2or3();       &#

34、160;         m1.sort(100,200);                 System.out.println("兩個(gè)數(shù)從大到小為："+m1.max1+","+m1.max2);          &

35、#160;      m1.sort(50,150,100);                 System.out.println("三個(gè)數(shù)從大到小為："+m1.max1+","+m1.max2+","+m1.max3);         

36、;     五、運(yùn)行下面的程序，理解方法的覆蓋。 class sort_Demo            int i,j,k,swap;            sort_Demo()            

37、60;      i=j=k=swap=0;                        void sort(int t1,int t2)                

38、;   /父類中的方法用來(lái)實(shí)現(xiàn)升序                   /用選擇法按升序排列                   for(i=0;i<t1-1;i+)    

39、                      k=i;                          for(j=i+1;j<t1;

40、j+)                                 if(t2j<t2k) k=j;              &

41、#160;           if (k!=i)                                 swap=t2i;    

42、;                             t2i=t2k;                    &#

43、160;            t2k=swap;                                     

44、60;                     class sub_sort_Demo extends sort_Demo            void sort(int t1,int t2)         

45、;   /子類中的方法實(shí)現(xiàn)降序                /用選擇法實(shí)現(xiàn)降序排列                   for(i=0;i<t1-1;i+)       &

46、#160;                  k=i;                          for(j=i+1;j<t1;j+)  

47、0;                              if(t2j>t2k) k=j;                 &#

48、160;        if (k!=i)                                 swap=t2i;       

49、                          t2i=t2k;                       

50、60;         t2k=swap;                                        

51、0;                         public class Class1            public static void main (String args)      

52、0;            int a=34,12,8,67,88,23,98,101,119,56;                sort_Demo m1=new sort_Demo();            &#

53、160;      sub_sort_Demo m2=new sub_sort_Demo();                         System.out.println("排序前的數(shù)據(jù)為：");       

54、            for (int i=0;i<10;i+)                          System.out.print("  "+ai);   

55、;                /調(diào)用父類中的sotr()方法         m1.sort(a.length ,a);                   System.out.pri

56、ntln("n按升序排列的數(shù)據(jù)為：");                   for (int i=0;i<10;i+)                          System.out.print(