zoukankan      html  css  js  c++  java
  • Java——导出类是否覆盖基类中方法,而发生的几种情况

    我们创建一个基类 Shape,然后Circle和Square 继承Shape。

    第一种情况:Circle 和 Square 都不覆盖基类的方法。

    class Shape {
    	public void draw() {
    		System.out.println("Shape!");
    	}
    }
    
    class Circle extends Shape {
    
    }
    
    class Square extends Shape {
    
    }
    
    
    public class Demo03 {
    	
    	public static void main(String[] args) {
    		// TODO Auto-generated method stub
    		Circle c = new Circle();
    		c.draw();
    		
    		Square s = new Square();
    		s.draw();
    	}
    }
    

    结果:

    第二种情况:Circle 覆盖基类方法 而 Square 不覆盖基类的方法。

    class Shape {
    	public void draw() {
    		System.out.println("Shape!");
    	}
    }
    
    class Circle extends Shape {
    	public void draw() {
    		System.out.println("Circle!");
    	}
    }
    
    class Square extends Shape {
    
    }
    
    
    public class Demo03 {
    	
    	public static void main(String[] args) {
    		// TODO Auto-generated method stub
    		Circle c = new Circle();
    		c.draw();
    		
    		Square s = new Square();
    		s.draw();
    		
    	}
    
    }
    

    结果:

    第三种情况:Circle 和 Square 都覆盖基类的方法。

    class Shape {
    	public void draw() {
    		System.out.println("Shape!");
    	}
    }
    
    class Circle extends Shape {
    	public void draw() {
    		System.out.println("Circle!");
    	}
    }
    
    class Square extends Shape {
    	public void draw() {
    		System.out.println("Square!");
    	}
    }
    
    
    public class Demo03 {
    	
    	public static void main(String[] args) {
    		// TODO Auto-generated method stub
    		Circle c = new Circle();
    		c.draw();
    		
    		Square s = new Square();
    		s.draw();
    		
    	}
    }
    

    结果:

    结论:如果导出类没有覆盖基类,那就自动运行基类中的方法;如果导出来覆盖了基类,那就运行导出类中覆盖的方法。

  • 相关阅读:
    Truck History(poj 1789)
    Highways poj 2485
    117. Populating Next Right Pointers in Each Node II
    116. Populating Next Right Pointers in Each Node
    115. Distinct Subsequences
    114. Flatten Binary Tree to Linked List
    113. Path Sum II
    109. Convert Sorted List to Binary Search Tree
    106. Construct Binary Tree from Inorder and Postorder Traversal
    105. Construct Binary Tree from Preorder and Inorder Traversal
  • 原文地址:https://www.cnblogs.com/strive-19970713/p/11236674.html
Copyright © 2011-2022 走看看