Given a string str and one of its character ch, the coverage of ch is computed as the number of elements between its leftmost and rightmost appearances (inclusive). For example, if str="babaac" and ch='a' then its leftmost and rightmost appearances occur at indices 1 and 4, respectively. Thus, the coverage of ch is 4. In this example, if ch='b' then its coverage is 3 since its leftmost and rightmost appearances occur at indices 0 and 2. Also, if ch='c', its coverage is 1. Write a function named findMaxCoverage that ● takes a string (str) and its size (n) as given below int findMaxCoverage (char str[], int n) returns the maximum coverage in str. For example, • if str="babaac", then the call findMaxCoverage (str, 6) should return 4, since this is the maximum of all character coverages found in the string, i.e., coverage of 'a' is 4, coverage of 'b' is 3, coverage of 'c' is 1. • if str="abcdefg", then the call findMaxCoverage (str, 7) the function should return 1 since all characters have coverage 1. . [NOTE] Do NOT change the function return type or its parameters. Your solution must be prepared using file template.c ●

EBK JAVA PROGRAMMING
8th Edition
ISBN:9781305480537
Author:FARRELL
Publisher:FARRELL
Chapter16: Graphics
Section: Chapter Questions
Problem 14RQ
icon
Related questions
Question

Have a Good DAY

Task
Given a string str and one of its character ch, the coverage of ch is computed as the number of
elements between its leftmost and rightmost appearances (inclusive). For example, if str="babaac"
and ch='a' then its leftmost and rightmost appearances occur at indices 1 and 4, respectively. Thus, the
coverage of ch is 4. In this example, if ch='b' then its coverage is 3 since its leftmost and rightmost
appearances occur at indices 0 and 2. Also, if ch='c', its coverage is 1.
Write a function named findMaxCoverage that
. takes a string (str) and its size (n) as given below
int findMaxCoverage (char str[], int n)
. returns the maximum coverage in str.
For example,
.
if str "babaac", then the call findMaxCoverage (str, 6) should return 4, since this is the
maximum of all character coverages found in the string, i.e., coverage of 'a' is 4, coverage of
'b' is 3, coverage of 'c' is 1.
• if str="abcdefg", then the call findMaxCoverage (str, 7) the function should return 1
since all characters have coverage 1.
. [NOTE] Do NOT change the function return type or its parameters.
● Your solution must be prepared using file template.c
Transcribed Image Text:Task Given a string str and one of its character ch, the coverage of ch is computed as the number of elements between its leftmost and rightmost appearances (inclusive). For example, if str="babaac" and ch='a' then its leftmost and rightmost appearances occur at indices 1 and 4, respectively. Thus, the coverage of ch is 4. In this example, if ch='b' then its coverage is 3 since its leftmost and rightmost appearances occur at indices 0 and 2. Also, if ch='c', its coverage is 1. Write a function named findMaxCoverage that . takes a string (str) and its size (n) as given below int findMaxCoverage (char str[], int n) . returns the maximum coverage in str. For example, . if str "babaac", then the call findMaxCoverage (str, 6) should return 4, since this is the maximum of all character coverages found in the string, i.e., coverage of 'a' is 4, coverage of 'b' is 3, coverage of 'c' is 1. • if str="abcdefg", then the call findMaxCoverage (str, 7) the function should return 1 since all characters have coverage 1. . [NOTE] Do NOT change the function return type or its parameters. ● Your solution must be prepared using file template.c
Expert Solution
steps

Step by step

Solved in 3 steps with 4 images

Blurred answer
Knowledge Booster
Randomized Select Algorithm
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781305480537
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT