FilesExpand file tree

 main

/

Problem34.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

31 lines (24 loc) · 729 Bytes

 main

/

Problem34.java

Top

File metadata and controls

• Code
• Blame

31 lines (24 loc) · 729 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

package Problems;

import java.util.Arrays;

import java.util.List;

//Given a list of integers,

// how do you check whether it contains at least one prime number using Java 8 Streams?

public class Problem34 {

public static boolean isPrime(int num){

if(num<2){

return false;

}

for(int i=2;i<=Math.sqrt(num);i++){

if(num%i==0){

return false;

}

}

return true;

}

public static void main(String[] args) {

List<Integer> numbers = Arrays.asList(58, 60, 62, 63, 64, 65);

boolean isContainPrime=numbers.stream()

.anyMatch(Problem34::isPrime);

System.out.println(isContainPrime);

}

}