CONSTRUCTOR CHALLENGE

MY APPROACH(BUGS)

public class Floor {
    private double length;
    private double width;

    public double getLength(){
        if(length<0)return 0;
        else return length;
    }
    public double getWidth(){
        if(width<0)return 0;
        else return width;
    }
    public void setLength(double length){
        this.length = length;
    }
    public void setWidth(double width){
        this.width = width;
    }
    public double getArea(){
         return (length * width);
    }
public class Carpet {
    private double cost;

    public double getCost(){
        if(cost<0)return 0;
        else return cost;
    }
    public void setCost(double cost){
        this.cost = cost;
    }
}

public class Calculator {
    private Floor floor;
    private Carpet carpet;

    public void setTotalCost(){
        this.floor=floor;
        this.carpet=carpet;
    }
    public double getTotalCost() {
        return (floor.getArea() * carpet.getCost());
    }
}

} 

BEST APPROACH

public class Floor {
    private double width;
    private double length;

    public Floor(double width,double length){
        if(width<0) this.width = 0;
        else this.width = width;

        if(length<0) this.length = 0;
        else this.length = length;
    }
    public double getArea(){
        return (this.width*this.length);
    }
    public class Carpet {
        private double cost;

        public Carpet(double cost){
            this.cost=(cost<0) ? 0 : cost;
        }
        public double getCost(){
            return cost;
        }
    }
    

    public class Calculator {
        private Floor floor;
        private Carpet carpet;

        public Calculator(Floor floor,Carpet carpet){
            this.floor = floor;
            this.carpet = carpet;
        }

        public double getTotalCost(){
            return (floor.getArea() * carpet.getCost());
        }

    }
}


Popular posts from this blog

NUMBER PALINDROME CHALLENGE

  package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( isPalindrome ( 101 )); } public static boolean isPalindrome ( int number) { int reverse = 0 ; int temporaryNumber =number; while (number!= 0 ){ reverse = reverse* 10 + number% 10 ; number = number/ 10 ; } if (reverse== temporaryNumber ) return true ; else return false ; } }
Read more

ENCAPSULATION CHALLENGE

package com.cnc ; public class Main { public static void main ( String [] args) { Printer printer = new Printer( 50 , true ); System . out .println( "Initial Page count is " + printer .getNumberOfPages()); int pagesPrinted = printer .getNumberOfPages( 4 ); } } package com.cnc ; public class Printer { private int tonerLevel = 100 ; private int numberOfPages ; private boolean isDuplex ; public Printer ( int tonerLevel, boolean isDuplex) { if (tonerLevel>=- 1 && tonerLevel<= 100 ) { this . tonerLevel = tonerLevel; } else { this . tonerLevel =- 1 ; } this . isDuplex = isDuplex; this . numberOfPages = 0 ; } public int addToner ( int tonerAmount){ if (tonerAmount> 0 && tonerAmount<= 100 ){ if ( this . tonerLevel +tonerAmount > 100 ){ return - 1 ; } this . tonerLevel += tonerAmount
Read more

LARGEST PRIME FACTOR OF A NUMBER

package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( getLargestPrime ( 20 )); System . out .println( getLargestPrime ( 7 )); } public static int getLargestPrime ( int number){ int i,stored=number; if (number<= 0 ) return - 1 ; else if ( isPrime (number)){ number=stored; } else { for ( i = 2 ; i < number; i++){ if (number%i== 0 ){ stored=i; } } } return stored; } public static boolean isPrime ( int n){ for ( int j = 2 ; j <n; j ++){ if (n% j == 0 ) return false ; else return true ; } return false ; } } ☑ Here i created a new method isTrue. if the number is prime then the number will return the same as output. but if it is not a prime then it will return the largest number excluding itself.
Read more