Skip to content

Instantly share code, notes, and snippets.

@codecademydev
Created September 28, 2020 02:39
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save codecademydev/214194aa35436bdde742b10bf4b9c5f6 to your computer and use it in GitHub Desktop.
Save codecademydev/214194aa35436bdde742b10bf4b9c5f6 to your computer and use it in GitHub Desktop.
Codecademy export
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