Skip to content

Instantly share code, notes, and snippets.

@codecademydev
Created October 31, 2020 16:28
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/7fa85014740e604d0b7251c09c554716 to your computer and use it in GitHub Desktop.
Save codecademydev/7fa85014740e604d0b7251c09c554716 to your computer and use it in GitHub Desktop.
Codecademy export
// Import statement:
import java.util.ArrayList;
class PrimeDirective {
// Add your methods here:
public boolean isPrime(int number){
if (number == 2) {
return false;
} else if (number < 2) {
return true;
}
for (int i = 2;i < number; i++){
if (number % i == 0){
return false;
} else {
return true;
}
}
} //missing return statement!!!
public ArrayList<Integer> onlyPrimes(int[] numbers) {
// method body goes here
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.isPrime(7));
System.out.println(pd.isPrime(28));
System.out.println(pd.isPrime(2));
System.out.println(pd.isPrime(0));
System.out.println(pd.onlyPrimes(numbers));
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment