
Use java language
Write the method named oddSum();
*
* Given a String str return the arithmetic sum
* of the odd-numbered digits '1'-'9' that appear in the string,
* ignoring all other characters. Return 0 if there
* are no digit characters in the string.
*
* You cannot use any of the classification methods in
* the Character class. You must use the relational operators
* and simple logic to decide if a character is a digit.
* (A character is a digit if it is between '0' and '9',
* inclusive. Notice these are char literals, not int literals.)
* To convert a digit character to a integer number, simply
* subtract the character '0'. For example, '7' - '0' --> 7.
* (Notice that subtracting two char results in an int.)
*
* Examples:
* oddSum("aa1bc2d3") returns 4 (2 is even)
* oddSum("aa11b33") returns 8
* oddSum("") returns 0
*
* @param str the String search for digits
* @return the sum of the digits odd digits

Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 images

- JAVA PPROGRAM ASAP Please create this program ASAP BECAUSE IT IS MY LAB ASSIGNMENT so it passes all the test cases. The program must pass the test case when uploaded to Hypergrade. Chapter 9. PC #2. Word Counter (page 608) Write a method that accepts a String object as an argument and returns the number of words it contains. For instance, if the argument is “Four score and seven years ago” the method should return the number 6. Demonstrate the method in a program that asks the user to input a string and then passes it to the method. The number of words in the string should be displayed on the screen. Test Case 1 Please enter a string or type QUIT to exit:\nHello World!ENTERThere are 2 words in that string.\nPlease enter a string or type QUIT to exit:\nI have a dream.ENTERThere are 4 words in that string.\nPlease enter a string or type QUIT to exit:\nJava is great.ENTERThere are 3 words in that string.\nPlease enter a string or type QUIT to exit:\nquitENTERarrow_forwardJava Programming: Write a program that reads five integer values from the user, then analyzes them as if they were a hand of cards. When your program runs it might look like this (user input is in orange for clarity): Enter five numeric cards, no face cards. Use 2 - 9. Card 1: 8 Card 2: 7 Card 3: 8 Card 4: 2 Card 5: 9 Pair! (This is a pair, since there are two eights). You are only required to find the hands Pair and Straight.arrow_forwardJava Programming: Question 12 Not sure how to do this question. Help of any input and output would be appreciated.arrow_forward
- /** 2. Write the method named countChar() * You are given a String str, and a char ch. Return the number of times that ch appears inside str, but ignore case. * * * Oh, and you can't use the classification methods in the Character class. Use plain if statements, remembering that you can check if ch is lowercase by checking if it is between lowercase 'a' and lowercase 'z', inclusive. Likewise, check if between 'A' and 'Z' for capital. To convert lowercase to uppercase, subtract the difference between lowercase 'a' and uppercase 'A' ('a'-'A') from the lowercase character. Add this difference to convert from uppercase to lowercase. * * * * * * Examples: countChar("Abcdefg", 'a') returns 1 countChar("xxXx", 'x') returns 4 countChar("", 'q') returns 0 * * @param str the String to search through @param ch the char to count (not case sensitive) @return the count of ch in str * */ public int countChar(String str, char ch) { // Complete the countChar method here }arrow_forwardthe function returns the result as a string if the expression is legal. the expression returns an empty string and then put the function public class Ez1MathEval {public String heavywtEval (String exprn) {return ""}}arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





