반응형
primenumber
-
checkPrimeNumberTech/Algorithm 2018. 10. 9. 23:39
/*Implement findPrimeNumber(k) that returns the k-th prime number. For example, findPrimeNumber(4) should return 7. */@Testpublic int findPrimeNumber(int k){ int i = 2; int step = 0; while(true){ if(isPrimeNumber(i)){ step ++; if(step == k){ return i; } } i++; }}public boolean isPrimeNumber(int k) { for(int i=2;i