Question

In: Computer Science

Using this 1000-digit string: 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 668966489504452445231

Using this 1000-digit string:
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

Write the following method: public static int largestValue(String str)
1. Take a single String parameter
2. Work from the beginning to the end of the string,
3. identify the five-character group that represents the largest five-digit number.
4. The method is then to return the largest five digit value in the String as an integer.
Note:
1. Only one 5-digit group is to be identified and returned, so if two or more identical values are in the string, only one of those values is to be returned.
2. Each 5-digit group is built upon every single digit in the group (less the final four digits), so the first two five-digit groups will be the following: 73167, 31671, and so on. The last five-digit group will be 63450.
3. Must use the String class substring( ) method to solve the above problem.
4. The five-digit groups are to be evaluated as integers, and the value of the largest five-digit number is to be returned as an integer.

PLEASE HELP ME UNDERSTAND HOW TO COMPLETE THIS METHOD OR WHERE TO LEARN MORE I AM LOST HERE THANK YOU, BELOW IS WHAT A START:

public class Problem2StarterFile
{
public static void main(String [] args)
{
//variable declarations
String s = "73167176531330624919225119674426574742355349194934" +
"96983520312774506326239578318016984801869478851843" +
"85861560789112949495459501737958331952853208805511" +
"12540698747158523863050715693290963295227443043557" +
"66896648950445244523161731856403098711121722383113" +
"62229893423380308135336276614282806444486645238749" +
"30358907296290491560440772390713810515859307960866" +
"70172427121883998797908792274921901699720888093776" +
"65727333001053367881220235421809751254540594752243" +
"52584907711670556013604839586446706324415722155397" +
"53697817977846174064955149290862569321978468622482" +
"83972241375657056057490261407972968652414535100474" +
"82166370484403199890008895243450658541227588666881" +
"16427171479924442928230863465674813919123162824586" +
"17866458359124566529476545682848912883142607690042" +
"24219022671055626321111109370544217506941658960408" +
"07198403850962455444362981230987879927244284909188" +
"84580156166097919133875499200524063689912560717606" +
"05886116467109405077541002256983155200055935729725" +
"71636269561882670428252483600823257530420752963450";
   
System.out.println("The largest value is: " + largestValue(s));   
}

public static int largestValue(String str)
{
//PLEASE HELP ME UNDERSTAND HOW TO COMPLETE THIS METHOD OR WHERE TO LEARN MORE I AM LOST HERE THANK YOU
return(0);
}
}

Solutions

Expert Solution

public class Problem2StarterFile
{
public static void main(String [] args)
{
    //variable declarations
    String s = "73167176531330624919225119674426574742355349194934" +
    "96983520312774506326239578318016984801869478851843" +
    "85861560789112949495459501737958331952853208805511" +
    "12540698747158523863050715693290963295227443043557" +
    "66896648950445244523161731856403098711121722383113" +
    "62229893423380308135336276614282806444486645238749" +
    "30358907296290491560440772390713810515859307960866" +
    "70172427121883998797908792274921901699720888093776" +
    "65727333001053367881220235421809751254540594752243" +
    "52584907711670556013604839586446706324415722155397" +
    "53697817977846174064955149290862569321978468622482" +
    "83972241375657056057490261407972968652414535100474" +
    "82166370484403199890008895243450658541227588666881" +
    "16427171479924442928230863465674813919123162824586" +
    "17866458359124566529476545682848912883142607690042" +
    "24219022671055626321111109370544217506941658960408" +
    "07198403850962455444362981230987879927244284909188" +
    "84580156166097919133875499200524063689912560717606" +
    "05886116467109405077541002256983155200055935729725" +
    "71636269561882670428252483600823257530420752963450";
     
    System.out.println("The largest value is: " + largestValue(s));   
}

public static int largestValue(String str)
{
    // get length of the string
    int len = str.length();
    int i;
    String tmp;
    int res = Integer.MIN_VALUE; // initialize max value result to -infinity
    // read every 5 length substring and convert it to integer and assign result as maximum of result and this integer
    for(i = 0; i < len-5; i++){
     tmp = str.substring(i, i+5);
     res = Math.max(res, Integer.parseInt(tmp));
    }
    return res;
}
}

Approach is explained within comments.


Related Solutions

1. How many 6 digit strings have a sum of 35? in a digit string the...
1. How many 6 digit strings have a sum of 35? in a digit string the first digit can be zero 2. In how many ways can one arrange the set {A,B,C,D,E} if E can not be on either end of the string A must be in an even position B must be in an odd position (Solve by direct method and P.I.E.)
Word to Digit Programming challenge description: Given a string representation of a set of numbers, print...
Word to Digit Programming challenge description: Given a string representation of a set of numbers, print the digit representation of the numbers. Input: Your program should read lines from standard input. Each line contains a list of word representations of numbers separated by a semicolon. There are up to 20 numbers in one line. The numbers are "zero" through "nine". Output: Print the sequence of digits. Test 1 Input zero;two;five;seven;eight;four Expected Test 1 output 025784 Test 2 Input three;seven;eight;nine;two Expected...
If we create a 5 digit bit string that is randomly generated, all strings equally likely......
If we create a 5 digit bit string that is randomly generated, all strings equally likely... 1. possibility of string containing three consecutive zeroes? 2. conditional probability of it containing three consecutive zeroes where first number is a one?
Java question - How can the code below be modified to accept multi digit input. String...
Java question - How can the code below be modified to accept multi digit input. String e = "1+9+8"; int r = e.charAt(0)-'0'; for (int i = 1; i < e.length(); i+=2){    if (e.charAt(i) == '+'){ r += e.charAt(i+1)-'0'; } else{ r -= e.charAt(i+1)-'0'; } The only built in String methods that can be used are lowercase(), length(), and charAt(). Arrays and parseInt() cannot be used. So we want to know how we can get an answer if a...
For each question below, calculate the number of four-digit integers (1000 through 9999 inclusive; the _rst...
For each question below, calculate the number of four-digit integers (1000 through 9999 inclusive; the _rst digit cannot be 0) that satisfy the specified property: 1. How many four-digit integers are even (for example, 2102 and 8162, but NOT 2001)? 2. How many four-digit integers are consisted of four distinct digits in strictly decreasing order (for example, 9621 and 8742, but NOT 1352)? (Hint: combination problem) 3. How many four-digit integers are consisted of two pairs of distinct digits (for...
For each question below, calculate the number of four-digit integers (1000 through 9999 inclusive; the first...
For each question below, calculate the number of four-digit integers (1000 through 9999 inclusive; the first digit cannot be 0) that satisfy the specified property: 1) How many four-digit integers are even (for example, 2102 and 8162, but NOT 2001)? 2) How many four-digit integers are consisted of four distinct digits in strictly decreasing order (for example, 9621 and 8742, but NOT 1352)? (Hint: combination problem) 3) How many four-digit integers are consisted of two pairs of distinct digits (for...
#include <iostream> using namespace std; string* callMe(string*& s){ static string* str = new string{"Chiqita Banana"}; str...
#include <iostream> using namespace std; string* callMe(string*& s){ static string* str = new string{"Chiqita Banana"}; str = s; return str; } int main() { string* s = new string{"Hey Google"}; string* str = callMe(s);    cout << "Call me \'" + *str +"\'"; return 0; } 1. What is the output or the error of this program? Call me 'Hey Google' 2. And please explain the data flow in detail (to memory level)? Please help question 2 with explanation, thank...
In this Exercise, you have to take a single string as input. Using this input string,...
In this Exercise, you have to take a single string as input. Using this input string, you have to create multiple queues in which each queue will comprise of separate word appeared in input string. At the end, you will again concatenate all queues to a single queue.s Example: String = “Data Structure and Algo” Q1 = D → a → t → a Q2 = S → t → r → u → c → t → u →...
Write a function that counts the colors in a string using JavaScript. String "The quick brown...
Write a function that counts the colors in a string using JavaScript. String "The quick brown fox jumped the blue fence and landed on red paint." This should return the number of colors. The colors you are looking for are "blue, green, brown, gray, black, brown, red, purple".
I am trying to tokenize a string using a function by passing the char string[] and...
I am trying to tokenize a string using a function by passing the char string[] and char *pointer[100]. While I have working code inside the int main(), I am having trouble actually declaring the parameters for the function. I know how to pass the char array (char string[]), but not how to pass the char pointer array (char *pointer[100]). This is my code below: int main() {    // Declare variables    char str[] = "this is a test only...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT