Help me solve this problem!:Method Skeletons and a Loop RoundupPractice these steps again and then solve the set of loop problems. These problems are more difficult than those in the previous lesson, so you'll need to take your time and work through each one step-by-step.Here is the link: https://codecheck.it/files/1906092225agosqgnp6wc7mwgcfpf6s4wky 6.* @version7*/8 public class PSØ6C9 {10/**Write the method named withoutString().11*12*13*Given two strings, base and remove, return aversion of the base string where all instancesof the remove string have been removed (not casesensitive). You may assume that the removestring is length 1 or more. Remove only non-overlappinginstances, so with "xxx" removing "xx" leaves "x".14*15*16*17*181920*Note: Despite the term "remove" you should actually nottry to remove the characters from a string. You'll continueto use the "building a string" pattern from lecture.2122*23Examples:withoutString("Hello there", "llo") returns "He there"withoutString("Hello there", "e") returns "HLlo thr"withoutString("Hello there", "x") returns "Hello there"24*2526*27*28*29@param base the base String to modify.@param remove the substring to remove.@return the base String with all copies of remove removed.30*3132*/33// TODO - Write the withoutString method here343536/**37*Write the method named sameEnds().38*39*Given a string, return the longest substringthat appears at both the beginning and end ofthe string without overlapping. For example,sameEnds("abXab") should return "ab".404142*43Examples:sameEnds("abXYab") returns "ab"sameEnds("xx") returns "x"sameEnds("xxx") returns "x"4445*4647*48@param str the String to search.@return the longest substring that appears at beginning and end.49*505152// TODO - Write the sameEnds method here.53 |5455/**56*Write the method named maxBlock().5758*Given a string, return the length of thelargest "block" in the string. A block is a runof adjacent characters that are the same.59*60*61Examples:maxBlock("hoopla") returns 2maxBlock("abbCCCddBBBxx") returns 3maxBlock("") returns 062*6364*6566*67*@param str the String to examine.@return the size of the longest run of adjacent characters.6869*/70// TODO - Write the maxBlock method here.717273 }

Answered: Practice these steps again and then…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Help me solve this problem!:

Method Skeletons and a Loop Roundup

Practice these steps again and then solve the set of loop problems. These problems are more difficult than those in the previous lesson, so you'll need to take your time and work through each one step-by-step.

Here is the link: https://codecheck.it/files/1906092225agosqgnp6wc7mwgcfpf6s4wky

6.
* @version
7
*/
8 public class PSØ6C
9 {
10
/**
Write the method named withoutString().
11
*
12
*
13
*
Given two strings, base and remove, return a
version of the base string where all instances
of the remove string have been removed (not case
sensitive). You may assume that the remove
string is length 1 or more. Remove only non-overlapping
instances, so with "xxx" removing "xx" leaves "x".
14
*
15
*
16
*
17
*
18
19
20
*
Note: Despite the term "remove" you should actually not
try to remove the characters from a string. You'll continue
to use the "building a string" pattern from lecture.
21
22
*
23
Examples:
withoutString("Hello there", "llo") returns "He there"
withoutString("Hello there", "e") returns "HLlo thr"
withoutString("Hello there", "x") returns "Hello there"
24
*
25
26
*
27
*
28
*
29
@param base the base String to modify.
@param remove the substring to remove.
@return the base String with all copies of remove removed.
30
*
31
32
*/
33
// TODO - Write the withoutString method here
34
35
36
/**
37
*
Write the method named sameEnds().
38
*
39
*
Given a string, return the longest substring
that appears at both the beginning and end of
the string without overlapping. For example,
sameEnds("abXab") should return "ab".
40
41
42
*
43
Examples:
sameEnds("abXYab") returns "ab"
sameEnds("xx") returns "x"
sameEnds("xxx") returns "x"
44
45
*
46
47
*
48
@param str the String to search.
@return the longest substring that appears at beginning and end.
49
*
50
51
52
// TODO - Write the sameEnds method here.
53 |
54
55
/**
56
*
Write the method named maxBlock().
57
58
*
Given a string, return the length of the
largest "block" in the string. A block is a run
of adjacent characters that are the same.
59
*
60
*
61
Examples:
maxBlock("hoopla") returns 2
maxBlock("abbCCCddBBBxx") returns 3
maxBlock("") returns 0
62
*
63
64
*
65
66
*
67
*
@param str the String to examine.
@return the size of the longest run of adjacent characters.
68
69
*/
70
// TODO - Write the maxBlock method here.
71
72
73 }

Expert Solution

Step 1

Here, we have used for loop and if-else statements to implement the required functions. For loop is used to iterate over the entire given string.

The following built-in string methods are used:

length() to find string length.

toLowerCase() to convert string to lower case.

substring() to obtain a specific portion of the string.

charAt() to obtain a character from specific position.

equals() for string comparison.

Step by step

Solved in 3 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions