public class PS06B { /** * Write the method xyzMiddle(). * * Given a String str, does "xyz" appear in the * "middle" of the string. To define middle, we'll * say that the number characters to the left and * right of the "xyz" must differ by, at most, one. * * Examples: * xyzMiddle("AAxyzBB") returns true * xyzMiddle("AxyzBB") returns true * xyzMiddle("AxyzBBB") returns false * * @param str the String to examine. * @return true if xyz is in the "middle" of str. */ // TODO - Write the method xyZMiddle here. /** * Write the method named repeatSeparator(). * * Given two String inputs, word and separator, * along with a third int input count, return a * big String consisting of count copies of word, * each separated by separator. * * Note: This is a very common algorithm, called the * fencepost algorithm, because just like building a * fence, you need 11 fenceposts to hold up 10 sections * of fence. * * Examples: * repeatSeparator("Word", "X", 3) returns "WordXWordXWord" * repeatSeparator("This", "And", 2) returns "ThisAndThis" * repeatSeparator("This", "And", 1) returns "This" * * @param word the first String parameter. * @param separator the second String parameter. * @param count the number of times to repeat word. * @return a new String as described here. */ // TODO - Write the repeatSeparator method here. /** * Write the method named sameStarChar(). * * Given a String str, return true if for every * '*' (star) in the string, if there are chars * both immediately before and after the star, * they are the same. * * Note: This is a little tricker than it looks. * One way to look at the problem is to see in * what circumstances you should return false. * You only return false if the characters on * either side of the * are different. That means * that if there are no characters in front of, * or behind the *, then you should return true, not false. * * Examples: * sameStarChar("xy*yzz") returns true * sameStarChar("xy*zzz") returns false * sameStarChar("*xa*az") returns true * * @param str the input String to process. * @return true if the characters before and after are the same. */ // TODO - Write the sameStarChar method here. }

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
icon
Related questions
Question

Help me solve this problem


/**
* Using the Counter-controlled while Loop.
*
* @author
* @version
*/
public class PS06B
{
/**
* Write the method xyzMiddle().
*
* Given a String str, does "xyz" appear in the
* "middle" of the string. To define middle, we'll
* say that the number characters to the left and
* right of the "xyz" must differ by, at most, one.
*
* Examples:
* xyzMiddle("AAxyzBB") returns true
* xyzMiddle("AxyzBB") returns true
* xyzMiddle("AxyzBBB") returns false
*
* @param str the String to examine.
* @return true if xyz is in the "middle" of str.
*/
// TODO - Write the method xyZMiddle here.


/**
* Write the method named repeatSeparator().
*
* Given two String inputs, word and separator,
* along with a third int input count, return a
* big String consisting of count copies of word,
* each separated by separator.
*
* Note: This is a very common algorithm, called the
* fencepost algorithm, because just like building a
* fence, you need 11 fenceposts to hold up 10 sections
* of fence.
*
* Examples:
* repeatSeparator("Word", "X", 3) returns "WordXWordXWord"
* repeatSeparator("This", "And", 2) returns "ThisAndThis"
* repeatSeparator("This", "And", 1) returns "This"
*
* @param word the first String parameter.
* @param separator the second String parameter.
* @param count the number of times to repeat word.
* @return a new String as described here.
*/
// TODO - Write the repeatSeparator method here.

/**
* Write the method named sameStarChar().
*
* Given a String str, return true if for every
* '*' (star) in the string, if there are chars
* both immediately before and after the star,
* they are the same.
*
* Note: This is a little tricker than it looks.
* One way to look at the problem is to see in
* what circumstances you should return false.
* You only return false if the characters on
* either side of the * are different. That means
* that if there are no characters in front of,
* or behind the *, then you should return true, not false.
*
* Examples:
* sameStarChar("xy*yzz") returns true
* sameStarChar("xy*zzz") returns false
* sameStarChar("*xa*az") returns true
*
* @param str the input String to process.
* @return true if the characters before and after are the same.
*/
// TODO - Write the sameStarChar method here.


}

PS06B.java
2 /**
3
* Using the Counter-controlled while Loop.
4
*
5
* @author
6
* @version
7
*/
8 public class PS06B
9 {
10
/**
11
Write the method xyzMiddle().
*
12
*
Given a String str, does "xyz" appear in the
"middle" of the string. To define middle, we'll
say that the number characters to the left and
right of the "xyz" must differ by, at most, one.
13
*
14
*
15
*
16
17
*
18
Examples:
xyzMiddle("AAxyzBB") returns true
xyzMiddle("AxyzBB") returns true
xyzMiddle("AxyzBBB") returns false
*
19
*
20
*
21
*
22
@param str the String to examine.
@return true if xyz is in the "middle" of str.
23
*
24
25
*/
26
// TODO
Write the method xyZMiddle here.
27
28
29
/**
30
Write the method named repeatSeparator().
*
31
*
Given two String inputs, word and separator,
along with a third int input count, return a
* big String consisting of count copies of word,
each separated by separator.
32
*
33
*
34
35
*
36
*
Note: This is a very common algorithm, called the
fencepost algorithm, because just like building a
fence, you need 11 fenceposts to hold up 10 sections
of fence.
37
*
38
*
39
*
40
41
*
42
*
Examples:
Transcribed Image Text:PS06B.java 2 /** 3 * Using the Counter-controlled while Loop. 4 * 5 * @author 6 * @version 7 */ 8 public class PS06B 9 { 10 /** 11 Write the method xyzMiddle(). * 12 * Given a String str, does "xyz" appear in the "middle" of the string. To define middle, we'll say that the number characters to the left and right of the "xyz" must differ by, at most, one. 13 * 14 * 15 * 16 17 * 18 Examples: xyzMiddle("AAxyzBB") returns true xyzMiddle("AxyzBB") returns true xyzMiddle("AxyzBBB") returns false * 19 * 20 * 21 * 22 @param str the String to examine. @return true if xyz is in the "middle" of str. 23 * 24 25 */ 26 // TODO Write the method xyZMiddle here. 27 28 29 /** 30 Write the method named repeatSeparator(). * 31 * Given two String inputs, word and separator, along with a third int input count, return a * big String consisting of count copies of word, each separated by separator. 32 * 33 * 34 35 * 36 * Note: This is a very common algorithm, called the fencepost algorithm, because just like building a fence, you need 11 fenceposts to hold up 10 sections of fence. 37 * 38 * 39 * 40 41 * 42 * Examples:
Examples:
repeatSeparator("Word", "X", 3) returns "WordXWordXWord"
repeatSeparator("This", "And", 2) returns "ThisAndThis"
repeatSeparator("This", "And", 1) returns "This"
42
43
*
44
*
45
*
46
*
@param word the first String parameter.
@param separator the second String parameter.
@param count the number of times to repeat word.
@return a new String as described here.
47
48
49
*
50
*
51
*/
52
// TODO - Write the repeatSeparator method here.
53
54
/**
55
Write the method named sameStarChar().
56
*
Given a String str, return true if for every
(star) in the string, if there are chars
both immediately before and after the star,
they are the same.
57
58
59
60
61
Note: This is a little tricker than it looks.
One way to look at the problem is to see in
what circumstances you should return false.
You only return false if the characters on
62
*
63
*
64
*
65
*
66
either side of the * are different. That means
that if there are no characters in front of,
or behind the *, then you should return true, not false.
67
68
69
Examples:
sameStarChar("xy*yzz") returns true
sameStarChar("xy*zzz") returns false
sameStarChar("*xa*az") returns true
70
71
*
72
73
*
74
*
75
@param str the input String to process.
76
*
@return true if the characters before and after are the same.
77
*/
78
// TODO
Write the sameStarChar method here.
79
80
81 }
Submit
Transcribed Image Text:Examples: repeatSeparator("Word", "X", 3) returns "WordXWordXWord" repeatSeparator("This", "And", 2) returns "ThisAndThis" repeatSeparator("This", "And", 1) returns "This" 42 43 * 44 * 45 * 46 * @param word the first String parameter. @param separator the second String parameter. @param count the number of times to repeat word. @return a new String as described here. 47 48 49 * 50 * 51 */ 52 // TODO - Write the repeatSeparator method here. 53 54 /** 55 Write the method named sameStarChar(). 56 * Given a String str, return true if for every (star) in the string, if there are chars both immediately before and after the star, they are the same. 57 58 59 60 61 Note: This is a little tricker than it looks. One way to look at the problem is to see in what circumstances you should return false. You only return false if the characters on 62 * 63 * 64 * 65 * 66 either side of the * are different. That means that if there are no characters in front of, or behind the *, then you should return true, not false. 67 68 69 Examples: sameStarChar("xy*yzz") returns true sameStarChar("xy*zzz") returns false sameStarChar("*xa*az") returns true 70 71 * 72 73 * 74 * 75 @param str the input String to process. 76 * @return true if the characters before and after are the same. 77 */ 78 // TODO Write the sameStarChar method here. 79 80 81 } Submit
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 1 images

Blurred answer
Knowledge Booster
InputStream
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education