public static String[] getTokens(String raw, String delimiter){ // Line #1 goes here... int numTokens = st.countTokens(); // Line #3 goes here... for(int i = 0; i < numTokens; i++){ // Line #5 goes here } // Line #7 goes here } Using the code above, which one of these should be the code for "Line #7": ret[i] = st.nextToken(); return ret; String[] ret = new String[numTokens]; StringTokenizer st = new StringTokenizer(raw, delimiter);

public static String[] getTokens(String raw, String delimiter){ // Line #1 goes here... int numTokens = st.countTokens(); // Line #3 goes here... for(int i = 0; i < numTokens; i++){ // Line #5 goes here } // Line #7 goes here } Using the code above, which one of these should be the code for "Line #7": ret[i] = st.nextToken(); return ret; String[] ret = new String[numTokens]; StringTokenizer st = new StringTokenizer(raw, delimiter);

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

// SuperMarket.java - This program creates a report that lists weekly hours worked // by employees of a supermarket. The report lists total hours for // each day of one week. // Input: Interactive // Output: Report. import java.util.Scanner; public class SuperMarket { public static void main(String args[]) { // Declare variables. final String HEAD1 = "WEEKLY HOURS WORKED"; final String DAY_FOOTER = " Day Total "; // Leading spaces are intentional. final String SENTINEL = "done"; // Named constant for sentinel value. double hoursWorked = 0; // Current record hours. String hoursWorkedString = ""; // String version of hours String dayOfWeek; // Current record day of week. double hoursTotal = 0; // Hours total for a day. String prevDay = ""; // Previous day of week. boolean done = false; // loop control Scanner input = new…
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string.This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is,str = new StringBuilder(str).reverse().toString(); Here's the tester it must pass: @Test public void testPancakeScramble() throws IOException {// Explicit test casesassertEquals("", P2J3.pancakeScramble(""));assertEquals("alu",…
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string. This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is, str = new StringBuilder(str).reverse().tostring(); A bit convoluted, but does what is needed without fuss or muss. Maybe one day the Java strings will come with the reverse method built in, just like the string data types of all sensible…
Multiples(): Takes an int (n) as parameter and prints first 10 multiples n in a single line using for loop. Example: 5 5,10,15,20,25,30,35,40,45,50 class Main {public static void main(String[] args) {}}
T/F A Java main method uses the parameter (String[ ] variable) so that a user can run the program and supply“command-line” parameters. Since the parameter is a String array, however, the user does not have to supply anyparameters.
Fix the errors and find the lowest marks entered by the user struct std{string name;int reg_no;int marks[5];}s1;getline(cin,s1.name);cin>>s1.reg_no;for(int i =0;i<5;i++)cin>>s1.marks[i]
int func(int a, int b) { return (a
// Application allows user to enter a series of words // and displays them in reverse order import java.util.*; public class DebugEight4 { publicstaticvoidmain(String[] args) { Scanner input =newScanner(System.in); int x =0, y; String array[] =newString[100]; String entry; finalString STOP =XXX; StringBuffer message =new StringBuffer("The words in reverse order are\n"); System.out.println("Enter any word\n" + "Enter + STOP + when you want to stop"); entry = input.next(); while(!(entry.equals(STOP))) { array[x] = entry; ++x; System.out.println("Enter another word\n" + "Enter "+STOP+" when you want to stop"); entry = input.next(); } for(y = x -1; y >0; ++y) { message.append(array[y]); message.append("\n"); } System.out.println(message) }
Fix the code to make it work properly pls // Converts a string to lowercase, and // displays the string's length // as well as a count of letters public class DebugSeven4 { public static void main(String[] args) { String aString = "HELP!! I need to get 37 things DONE today!!"; int numLetters = 0. int stringLength = aString.Length(); System.out.println("In all lowercase, the sentence is: "); for(int i = 0; i < stringLength; i++) { char ch = Character.toTheLowerCase(aString.charAt(i)); System.out.print(ch); if(Character.isLetter(ch)) numLetters--; } System.out.println(); System.out.println ("The number of CHARACTERS in the string is " + stringLength); System.out.println(The number of LETTERS is " + numLetters); } }
String Pair // Problem Description // One person hands over the list of digits to Mr. String, But Mr. String understands only strings. Within strings also he understands only vowels. Mr. String needs your help to find the total number of pairs which add up to a certain digit D. // The rules to calculate digit D are as follow // Take all digits and convert them into their textual representation // Next, sum up the number of vowels i.e. {a, e, i, o, u} from all textual representation // This sum is digit D // Now, once digit D is known find out all unordered pairs of numbers in input whose sum is equal to D. Refer example section for better understanding. // Constraints // 1 <= N <= 100 // 1 <= value of each element in second line of input <= 100 // Number 100, if and when it appears in input should be converted to textual representation as hundred and not as one hundred. Hence number…
DebugEight4: Here is the code that needs to be debugged, I fixed some but it will not display the words in reverse at the end: // Application allows user to enter a series of words // and displays them in reverse order import java.util.*; public class DebugEight4 { public static void main(String[] args) { Scanner input = new Scanner(System.in); int x = 0, y; String array[] = new String[100]; String entry; final String STOP = "XXX"; StringBuffer message = new StringBuffer("The words in reverse order are\n"); System.out.println("Enter any word\n" + "Enter + STOP + when you want to stop"); entry = input.next(); while(!(entry.equals(STOP))) { array[x] = entry; ++x; System.out.println("Enter another word\n" + "Enter " + STOP + " when you want to stop"); entry = input.next(); } for(y = x - 1; y > 0; ++y) {…
int main(){ string str; int count = 0; // user input cout << "Enter string: "; cin >> str; int n = str.length(); // iterating over the string for (int i = 0; i < n - 1; i++) { // calling the fucntion to find the palidrome strings from the user input if (isPalindrome(0, i, str) && isPalindrome(i + 1, n - 1, str)) { // if 2 substring are palindrome then print them and increment count for (int x = 0; x < i + 1; x++) cout << str[x]; cout << " "; for (int x = i + 1; x < n; x++) cout << str[x]; count++; // break the loop after printing the palindrom string break; } } // if count is 0 then no palindrome subtring pair found if (count == 0) cout << "NO";} change this code to stdio.h string.h