Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions AP1403 - WarmUp/.idea/.name

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion AP1403 - WarmUp/.idea/misc.xml

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

78 changes: 68 additions & 10 deletions AP1403 - WarmUp/src/main/java/Exercises.java
Original file line number Diff line number Diff line change
@@ -1,11 +1,28 @@
public class Exercises {

/*
complete this function to check if the input number is prime or not
*/

public boolean isPrime(long n) {
// todo
return false;
if(n <= 1)
{
return false;
}
if(n == 2 || n == 3)
{
return true;
}
if(n % 2 == 0 )
{
return false;
}
else
{
for (long i = 3; i * i <= n ; i += 2) {
if (n % i == 0) {
return false;
}

}
}
return true;
}

/*
Expand All @@ -15,8 +32,36 @@ public boolean isPrime(long n) {
if the input is not a fibonacci number with description above, return -1
*/
public long fibonacciIndex(long n) {
// todo
return -1;
if(n < 0 )
{
return -1;
}
if(n == 0)
{
return 0;
}
if(n == 1)
{
return 1;
}

long fib1 = 0;
long fib2 = 1;
long index = 1;
while(fib2 < n)
{
long temp = fib2;
fib2 = fib1+fib2;
fib1 = temp;
index++;
}
if(fib2 == n)
{
return index;
}
else {
return -1;
}
}

/*
Expand All @@ -38,8 +83,21 @@ public long fibonacciIndex(long n) {
the output has to be a two-dimensional array of characters, so don't just print the triangle!
*/
public char[][] generateTriangle(int n) {
// todo
return null;

if (n <= 0) return new char[0][0];
char[][] triangle = new char[n][];
for (int i = 0; i < n; i++) {
triangle[i] = new char[i + 1];

for (int j = 0; j <= i; j++) {
if (j == 0 || j == i || i == n - 1) {
triangle[i][j] = '*';
} else {
triangle[i][j] = ' ';
}
}
}
return triangle;
}

public static void main(String[] args) {
Expand Down