zoukankan      html  css  js  c++  java
  • (1)定义一个接口Compute含有一个方法int computer(int n,int m); (2)设计四个类分别实现此接口,完成+-*/运算 (3)设计一个类UseCompute,含有方法: public void useCom(Compute com, int one, int two) (4)设计一个测试类

    package b;
    
    public interface Computer {
        int computer(int n,int m);
    
    }
    
    package b;
    
    public class Jia implements Computer {
    
        @Override
        public int computer(int n, int m) {
            int jia;
            jia=m+n;
            System.out.println(m+"+"+n+"="+jia);
            return jia;
        }
    
    }
    
    package b;
    
    public class Jian implements Computer {
    
        @Override
        public int computer(int n, int m) {
            int jian;
            jian=m-n;
            System.out.println(m+"-"+n+"="+jian);
            return jian;
        }
    
    }
    package b;
    
    public class Jian implements Computer {
    
        @Override
        public int computer(int n, int m) {
            int jian;
            jian=m-n;
            System.out.println(m+"-"+n+"="+jian);
            return jian;
        }
    
    }
    
    package b;
    
    public class Cheng implements Computer {
    
        @Override
        public int computer(int n, int m) {
            int cheng;
            cheng=m*n;
            System.out.println(m+"*"+n+"="+cheng);
            return cheng;
        }
    
    }
    
    package b;
    
    public class Chu implements Computer {
    
        @Override
        public int computer(int n, int m) {
            int chu;
            chu=m/n;
            System.out.println(m+"/"+n+"="+chu);
            return chu;
        }
    
    }
    
    package b;
    
    public class UseComputer implements Computer {
    
        @Override
        public int computer(int n, int m) {
            
            return 0;
        }
        
        
        public void useCom(Computer com, int n, int m)
        {
            com.computer(n, m);
        }
        
    
    }
    
    package b;
    
    public class TestComputer {
    
        public static void main(String[] args) {
        UseComputer m=new UseComputer();
        Jia a=new Jia();
        Jian b=new Jian();
        Cheng c=new Cheng();
        Chu d=new Chu();
        m.useCom(a, 3, 5);
        m.useCom(b, 3, 5);
        m.useCom(c, 3, 5);
        m.useCom(d, 3, 5);
        }
    
    }
  • 相关阅读:
    点击<a>页面跳转解决办法/跨域请求,JSONP
    笔记一下NODEJS建站
    地精排序Gnome Sort ----(排序算法十)
    鸡尾酒排序Cocktail Sort(排序算法九)
    鸽巢排序Pigeonhole Sort----(排序算法八)
    桶排序(Bucket Sort)----(排序算法七)
    堆排序----(排序算法六)
    简单选择排序算法----(排序算法五)
    快速排序----(排序算法四)
    冒泡排序法---排序算法(三)
  • 原文地址:https://www.cnblogs.com/ljxe/p/5533395.html
Copyright © 2011-2022 走看看