-
-
Save codecademydev/214194aa35436bdde742b10bf4b9c5f6 to your computer and use it in GitHub Desktop.
Codecademy export
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.ArrayList; | |
class PrimeDirective { | |
// Add your methods here: | |
public boolean isPrime(int number){ | |
if (number == 2){ | |
return true; | |
} else if (number < 2){ | |
return false; | |
} | |
for (int i = 2; i < number; i++){ | |
if (number % i == 0) { | |
return false; | |
} else if (number % 3 == 0) { | |
return false; | |
} | |
} | |
return true; | |
} | |
//new method for making list of primes | |
public ArrayList<Integer> onlyPrimes(int[] numbers){ | |
ArrayList<Integer> primes = new ArrayList<Integer>; | |
for (int number : numbers){ | |
if (isPrime(number)){ | |
primes.add(number); | |
} | |
} | |
return primes; | |
} | |
public static void main(String[] args) { | |
PrimeDirective pd = new PrimeDirective(); | |
int[] numbers = {6, 29, 28, 33, 11, 100, 101, 43, 89}; | |
System.out.println(pd.onlyPrimes(numbers)); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment