Write a recursive method largestDigitthat accepts an integer parameter and returns the largest digit value that appears in that integer. Your method should work for both positive and negative numbers. If a number contains only a single digit, that digit's value is by definition the largest. The following table shows several example calls: Call Value Returned largestDigit(14263203) 6 largestDigit(845) 8 largestDigit(52649) 9 largestDigit(3) 3 largestDigit(0) 0 largestDigit(-573026) 7 largestDigit(-2) 2 Obey the following restrictions in your solution: You may not use a String, Scanner, array, or any data structure (list, stack, map, etc.). Your method must be recursive and not use any loops (for, while, etc.). Your solution should run in no worse than O(N) time, where N is the number of digits in the number.
Write a recursive method largestDigitthat accepts an integer parameter and returns the largest digit value that appears in that integer. Your method should work for both positive and negative numbers. If a number contains only a single digit, that digit's value is by definition the largest. The following table shows several example calls: Call Value Returned largestDigit(14263203) 6 largestDigit(845) 8 largestDigit(52649) 9 largestDigit(3) 3 largestDigit(0) 0 largestDigit(-573026) 7 largestDigit(-2) 2 Obey the following restrictions in your solution: You may not use a String, Scanner, array, or any data structure (list, stack, map, etc.). Your method must be recursive and not use any loops (for, while, etc.). Your solution should run in no worse than O(N) time, where N is the number of digits in the number.
Chapter8: Arrays
Section: Chapter Questions
Problem 20RQ
Related questions
Question
java
- Write a recursive method largestDigitthat accepts an integer parameter and returns the largest digit value that appears in that integer. Your method should work for both positive and negative numbers. If a number contains only a single digit, that digit's value is by definition the largest. The following table shows several example calls:
Call |
Value Returned |
largestDigit(14263203) |
6 |
largestDigit(845) |
8 |
largestDigit(52649) |
9 |
largestDigit(3) |
3 |
largestDigit(0) |
0 |
largestDigit(-573026) |
7 |
largestDigit(-2) |
2 |
Obey the following restrictions in your solution:
- You may not use a String, Scanner, array, or any data structure (list, stack, map, etc.).
- Your method must be recursive and not use any loops (for, while, etc.).
- Your solution should run in no worse than O(N) time, where N is the number of digits in the number.
Expert Solution
Step 1: algorithm
if (num == 0)
return 0;
num = Math.abs(num);
int lastNum = num % 10;
int otherDigits = num / 10;
int recursiveLastNum = largestDigit(otherDigits);
//System.out.println(recursiveLastNum);
return Math.max(lastNum, recursiveLastNum);
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT