Skip to content

Instantly share code, notes, and snippets.

@awaemmanuel

awaemmanuel/UglyNumber.java

Forked from cangoal/UglyNumber.java
Created April 14, 2016 19:38
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save awaemmanuel/c16a2ecd4de0358c86d26e41bd611c6d to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save awaemmanuel/c16a2ecd4de0358c86d26e41bd611c6d to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. @cangoal cangoal revised this gist Apr 7, 2016. 2 changed files with 21 additions and 21 deletions.
    21 changes: 0 additions & 21 deletions Ugly Number
    View file
    Original file line number Diff line number Diff line change
    @@ -1,21 +0,0 @@
    //
    public boolean isUgly(int num) {
    if (num == 0) return false;
    while (num % 2 == 0) num /= 2;
    while (num % 3 == 0) num /= 3;
    while (num % 5 == 0) num /= 5;
    return num == 1;
    }
    //
    public boolean isUgly(int num) {
    if(num <= 0) return false;
    int[] factor = {2, 3 ,5};
    int i = 0;
    while(num != 1){
    int remainder = num % factor[i];
    if(remainder == 0) num = num / factor[i];
    else if(i < factor.length-1) i++;
    else if(i == factor.length-1) break;
    }
    return num == 1;
    }
    21 changes: 21 additions & 0 deletions UglyNumber.java
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,21 @@
    //
    public boolean isUgly(int num) {
    if (num == 0) return false;
    while (num % 2 == 0) num /= 2;
    while (num % 3 == 0) num /= 3;
    while (num % 5 == 0) num /= 5;
    return num == 1;
    }
    //
    public boolean isUgly(int num) {
    if(num <= 0) return false;
    int[] factor = {2, 3 ,5};
    int i = 0;
    while(num != 1){
    int remainder = num % factor[i];
    if(remainder == 0) num = num / factor[i];
    else if(i < factor.length-1) i++;
    else if(i == factor.length-1) break;
    }
    return num == 1;
    }
  2. @cangoal cangoal revised this gist Sep 24, 2015. 1 changed file with 2 additions and 1 deletion.
    3 changes: 2 additions & 1 deletion Ugly Number
    View file
    Original file line number Diff line number Diff line change
    @@ -1,11 +1,12 @@
    //
    public boolean isUgly(int num) {
    if (num == 0) return false;
    while (num % 2 == 0) num /= 2;
    while (num % 3 == 0) num /= 3;
    while (num % 5 == 0) num /= 5;
    return num == 1;
    }

    //
    public boolean isUgly(int num) {
    if(num <= 0) return false;
    int[] factor = {2, 3 ,5};
  3. @cangoal cangoal revised this gist Sep 15, 2015. 1 changed file with 8 additions and 0 deletions.
    8 changes: 8 additions & 0 deletions Ugly Number
    View file
    Original file line number Diff line number Diff line change
    @@ -1,3 +1,11 @@
    public boolean isUgly(int num) {
    if (num == 0) return false;
    while (num % 2 == 0) num /= 2;
    while (num % 3 == 0) num /= 3;
    while (num % 5 == 0) num /= 5;
    return num == 1;
    }

    public boolean isUgly(int num) {
    if(num <= 0) return false;
    int[] factor = {2, 3 ,5};
  4. @cangoal cangoal created this gist Aug 24, 2015.
    12 changes: 12 additions & 0 deletions Ugly Number
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,12 @@
    public boolean isUgly(int num) {
    if(num <= 0) return false;
    int[] factor = {2, 3 ,5};
    int i = 0;
    while(num != 1){
    int remainder = num % factor[i];
    if(remainder == 0) num = num / factor[i];
    else if(i < factor.length-1) i++;
    else if(i == factor.length-1) break;
    }
    return num == 1;
    }