codewars——java(3)

A square of squares

You like building blocks. You especially like building blocks that are squares. And what you even like more, is to arrange them into a square of square building blocks!

However, sometimes, you can't arrange them into a square. Instead, you end up with an ordinary rectangle! Those blasted things! If you just had a way to know, whether you're currently working in vain… Wait! That's it! You just have to check if your number of building blocks is a perfect square.

Task

Given an integral number, determine if it's a square number:

In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself.

The tests will always use some integral number, so don't worry about that in dynamic typed languages.



public class Square {

    public static boolean isSquare(int n) {

Boolean isB = false;

        if(n<0){

            isB= false;

        }

        else if(n>0){

            double m= Math.sqrt(n);

            System.out.println(m);

            String a = String.valueOf(m);

            String[] num = a.split("\\.");

            if(num.length==2){

                if(num[1].length()>1){

                    isB=false;

                }else{

                    String c=num[1].substring(0,1);

                    int d=Integer.parseInt(c);

                    if(d>0){

                        isB=false;

                    }else {

                        isB=true;

                    }

                }

            }else{

                isB=true;

            }

        }else if(n==0){

            isB=true;

        }


        return isB; // fix me!

    }

}



https://www.codewars.com/kata/54c27a33fb7da0db0100040e/train/java

你可能感兴趣的:(codewars——java(3))