Screenshot of output:

Screenshot of code:


![return max; public static void main(Stringl] args]) scanner sc = new scanner (System·in), System.out.println(Enter the strin](http://img.homeworklib.com/questions/dd319b00-779f-11eb-a5f1-f312e6742ad7.png?x-oss-process=image/resize,w_560)
Code:
import java.util.Scanner;
import java.lang.StringBuilder;
//Class StringCode
public class StringCode
{
public static String blowup(String str)
{
//stb is used for
holding the desired string str.
StringBuilder stb = new
StringBuilder(str);
//substr is used for the
substring which replaces the number in the string as desired.
String substr =
"";
//getting the ascii
value of the characters of str in an array b.
byte[] b =
str.getBytes();
//The following loop
iterates upto the second last character as...
//there is no need to
check the following condition for the last character.
for(int i = 0; i <
str.length()-1; i++)
{
//Checking whether there is any number in the string.
if(b[i] >= 48 && b[i] <= 57)
{
//Get the integer value of the number.
int n = Integer.parseInt(str.substring(i,i+1));
substr = "";
//Repeat the next character of the digit for that many times.
for(int j = 0; j < n; j++)
{
//substr consists of the repiting character.
substr += str.substring(i + 1, i + 2);
}
//Replace the digit by substr
stb.replace(i, i + 1, substr);
}
}
//Return the string
value of stb.
return
stb.toString();
}
public static int maxRun(String str)
{
//Default value of
count.
int count, max =
1;
//The following loop
iterates upto the second last character as...
//there is no need to
check the following condition for the last character.
for(int i = 0; i <
str.length()-1; i++)
{
count = 1;
//Compare a character with the next to check the occurrences.
if(str.charAt(i) == str.charAt(i + 1))
{
// Using do-while loop to calculate the length of the run
do{
count++; // Increase count
i++; // Move to next character
}while(i < str.length()-1 && str.charAt(i) ==
str.charAt(i + 1)); // Checking if the run continues
if(max < count) // Updating maximum run
max = count;
}
}
return max;
}
public static void main(String[] args)
{
Scanner sc = new
Scanner(System.in);
System.out.println("Enter the string:");
String str =
sc.nextLine();
System.out.println("Test
1");
String result =
blowup(str);
System.out.println("Result for test 1 = " + result);
System.out.println("Test
2");
int num =
maxRun(str);
System.out.println("Result for test 2 = " + num);
}
}
Write a class called StringCode with the following functions. (Do not change these function names or...
Given a string, recursively compress all sets of repeating adjacent chars within an existing string to a single char. For example, "XVxzzz" yields "xyz" <pre> ceoveReaeatsl"fffaaac Quuutreturns "far Out" eoveReneatsC"nogoge wogorcriiies") returns "no worries" remaveReneats.C" Tomorrow") returns "Iomeo" s /pre Qparam stc a string of characters @return a version of the original string with all repeating adjacent sequences of the same character, reduced to a single character public static String removeRepeats (String str) { ou are forbidden to use any...
JAVA:
Run length encoding is a simple form of data compression. It
replaces long sequences of a repeated value with one occurrence of
the value and a count of how many times to repeat it. This works
reasonably well when there are lots of long repeats such as in
black and white images. To avoid having to represent non-repeated
runs with a count of 1 and the value, a special value is often used
to indicate a run and everything...
Write a Python function called more() that takes three string inputs and outputs a string Formally, the function signature and output are given by rucharist, char: str words str) > str Use the same names for the input arguments as shown above Note that charl and char2 will always be a string of length 1 (ie, it is a single character. The function checks which of charl or char2 appears more often in the word string and returns that character...
Use Java to answer the question (Occurrences of a specified character) Write a method that finds the number of occurrences of a special character in a string using the following header: public static int count (String str, char a) For example, count("Welcome", 'e') returns 2. Write a test program that prompts the user to enter a string followed by a character then displays the number of occurrences of the character in the string. In addition to the requirements described in...
Java StringNode Case Study: Rewrite the following methods in the StringNode class shown below. Leave all others intact and follow similar guidelines. The methods that need to be changed are in the code below. - Rewrite the indexOf() method. Remove the existing recursive implementation of the method, and replace it with one that uses iteration instead. - Rewrite the isPrefix() method so that it uses iteration. Remove the existing recursive implementation of the method, and replace it with one that...
roblem description Write the following functions as prototyped below. Do not alter the function signatures. Demonstrate each function using literal strings defined in your client program (e.g., don't prompt the user for test inputs) /// Returns a copy of the string with its first character capitalized //I and the rest lowercased /// Example: capitalize("hELLO WORLD") returns "Hello world std::string capitalize(const std::string&str) /// Returns a copy of the string centered in a string of length ·width.. /// Padding is done using...
This is Crypto Manager blank public class CryptoManager { private static final char LOWER_BOUND = ' '; private static final char UPPER_BOUND = '_'; private static final int RANGE = UPPER_BOUND - LOWER_BOUND + 1; /** * This method determines if a string is within the allowable bounds of ASCII codes * according to the LOWER_BOUND and UPPER_BOUND characters * @param plainText a string to be encrypted, if it is within the allowable bounds * @return true if all characters...
Using ONLY the following header functions: #include <iostream> #include <string> #include <cassert> #include <vector> using namespace std; Create a C++ function that satisfies the condition using recursion, NO WHILE OR FOR LOOPS. Pre-condition: s.size() == t.size() Post-condition: Returns a vector where the first string is the first character of s followed by the first character of t, the second string is the second character of s followed by the second character of t, and so on. For example, zip("abc", "xyz")...
Hi,
So I have a finished class for the most part aside of the toFile
method that takes a file absolute path +file name and writes to
that file. I'd like to write everything that is in my run method
also the toFile method. (They are the last two methods in the
class). When I write to the file this is what I get.
Instead of the desired
That I get to my counsel. I am
having trouble writing my...
1. Write a C++ program called Password that handles encrypting a
password.
2. The program must perform encryption as follows:
a. main method
i. Ask the user for a password.
ii. Sends the password to a boolean function called
isValidPassword to check validity.
1. Returns true if password is at least 8 characters long
2. Returns false if it is not at least 8 characters long
iii. If isValidPassword functions returns false
1. Print the following error message “The password...