Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- static boolean isPrime(int value){
- if(value%2==0 && value!=2){
- return false;
- }
- else {
- for(int i = 2; i<Math.sqrt(value); i++){
- if(value%i==0){
- return false;
- }
- }
- return true;
- }
- }
- static int maxDifference(int startVal, int endVal) {
- // Complete this function
- if(startVal==endVal){
- return 0;
- }
- else if(isPrime(startVal) && isPrime(endVal)){
- return endVal - startVal;
- }
- else{
- int min = 0;
- int max = 0;
- for(int i = startVal; i<=endVal; i++){
- if(min != 0 ){
- break;
- }
- else if(isPrime(i)){
- min = i;
- }
- }
- for(int i = endVal; i>=startVal; i--){
- if(max != 0){
- break;
- }
- else if(isPrime(i)){
- max = i;
- }
- }
- if((max == 0 && min != 0)||(min==0 && max!=0)){
- return 0;
- }
- return (max - min);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement