//================================
// 2
//================================
public static List<Integer> getPrimeNumbers(int from, int to) {
/*
Please implement this method to
return a list of all prime numbers in the given range (inclusively).
A prime number is a natural number that has exactly two distinct natural number divisors, which are 1 and the prime number itself.
The first prime numbers are: 2, 3, 5, 7, 11, 13
*/
List<Integer> numbers = new ArrayList<Integer>();
if (from < 2 || to < 2)
return numbers;
loop: for (int i = from; i <= to; i++)
{
for (int j = 2; j < i; j++)
if (i % j == 0)
continue loop;
numbers.add(i);
}
return numbers;
}
Code: Java
либо я непонял задания - либо тут чтото неверно имхо