Commit 57d84370 authored by william.leather's avatar william.leather

Replace AssessmentPartOne.java

parent 7805f22d
Pipeline #552 failed with stages
public class AssessmentPartOne { public class AssessmentPartOne {
public int biggestOfThree(int num1, int num2, int num3) public int biggestOfThree(int num1, int num2, int num3)
{ {
// 01 - A Gentle Start // 01 - A Gentle Start
// Debug this method so it passes the unit test. // Debug this method so it passes the unit test.
// Add comments beside any changes you make // Add comments beside any changes you make
if (num1<num2) if((num1 > num2) && (num1 > num3))
{ {
if (num3>num1) return num1;
{
return num3; }
} else if((num2 > num1) && (num2 > num3 ))
else {
{ return num2;
return num1; }
} else return num3;
}
else }
{
if (num3>num2) public int sumNumbersBetween(int start, int end)
{ {
return num3; // 02 - Adding Across A Range
} // Complete this method so that it adds together all
else // the integers between start and end, but not including
{ // start or end
return num2 // This method should only deal with 0 and positive integers
} // This method should return -1 if it cannot calculate the result
}
} // You should comment your code explaining what each part does
public int sumNumbersBetween(int start, int end) int sumOfSquares = 0;
{ if ((start >=0) && (end >=0) && (start<end) && (end > start+1))
// 02 - Adding Across A Range //condition to compare if start and end are integer variables
// Complete this method so that it adds together all //also comparing that start smaller then end
// the integers between start and end, but not including //and last comparing that there exists integer numbers between both variables to add
// start or end {
// This method should only deal with 0 and positive integers for (int i= start +1;i<end; i++)
// This method should return -1 if it cannot calculate the result {
//after the conditions above are true, then using the loop so we can add all
// You should comment your code explaining what each part does //the numbers between start and end without counting them.
sumOfSquares=sumOfSquares+i;
int sumOfSquares = 0; }
}
else return -1;
return sumOfSquares;
} return sumOfSquares;
}
}
}
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment