zoukankan      html  css  js  c++  java
  • 13.5

    //13.5
    import java.util.Scanner;
    import java.awt.*;
    
    import java.util.*;
    import javax.swing.*;
    import javax.swing.border.LineBorder;
    
    public class Test
    {    
        public static void main(String[] args) {
            double s1 = 0,s2 = 0,s3 = 0;
            Scanner input = new Scanner(System.in);
            s1 = input.nextDouble();
            s2 = input.nextDouble();
            s3 = input.nextDouble();
            try {Triangle t1 = new Triangle(s1,s2,s3);}
            catch(IllegalTriangleException ex){
                System.out.println(ex.getMessage());
            }
          }
    }
    Test.java
    public class Triangle {
        private double side1,side2,side3;
        
        public Triangle(double side1,double side2,double side3)
        throws IllegalTriangleException{
            if((side1+side2>side3)&&(side1+side3>side2)&&(side2+side3>side1))
                System.out.println("valid sides");
            else
                throw new IllegalTriangleException("invalid sides");        
        }    
    }
    Triangle.java
    public class IllegalTriangleException extends Exception{
        public IllegalTriangleException(String s)
        {
            super(s);
        }
    }
    IllegalTriangleException.java
  • 相关阅读:
    动态规划
    关键路径
    拓扑排序
    最小生成树
    Floyd 多源最短路径
    SPFA算法
    Bellman_Ford算法(负环的单源路径)
    Dijkstra算法
    fill和memset的区别
    Codeforces Round #655 (Div. 2) 题解
  • 原文地址:https://www.cnblogs.com/wanjiang/p/5568061.html
Copyright © 2011-2022 走看看