I tried to make a program that takes a string str, and char a and checks how many times the char is used in the string.
Example: the string Welcome and the letter e, is 2 times. so the program should print 2.
It compiles but when I run it and enter the information, i cannot get the printing line out.
Heres my code:
import java.util.Scanner;
class program
{
public static void main(String[] args) {
Scanner user_input=new Scanner(System.in);
String str;
String b;
System.out.print("Please enter a word");
I tried to make a program that takes a string str, and char a and checks how many times the char is used in the string. Example: the string Welcome and the letter e, is 2 times. so the program should print 2. It compiles but when I run it and enter the information, i cannot get the printing line out.
Heres my code:
import java.util.Scanner; class program { public static void main(String[] args) { Scanner user_input=new Scanner(System.in); String str; String b; System.out.print("Please enter a word"); str=user_input.next();
Basically the requirements are to take a sentence (string of text) and check to see how many times specific words come up and then add to the counter depending on the word.
But I can not seem to get it to add the instances of the goodwords and badwords.
package Strings; import java.io.*; public class SentimentAnalyser { private static String analyse(String text) { int pw = 0; int nw = 0; String[] searchword = { "bad", "terrible", "good", "awesome" };
I can't figure out how to have all of the random characters generated to go into the String. Below I can only get the last character to covert over to a String.
System.out.println("Original random character string:"); String printingString = "a"; for (int i = 0; i < 50; i++)//loop to obtain 50 random characters { char randomChar = (char) ((Math.random() * 255) +32); System.out.print(randomChar); printingString = Character.toString(randomChar); } return printingString; }
I found a fun program online and something so simple is giving me an issue. I c++ it is pretty simple fix, I can just call the strings location like an array. In java this is not the case. So far i have tried:
myString.charAt(); myString.indexOf();
There are a few other I found on google but I forget at the moment. I am just trying to close the gap on a string. It was a full sentence and I used replaceAll a few times to get several words I didn't want in the file out.
I can't figure out how to print this string only five times. I tried to use the * operator, but that doesn't work with strings apparently, unles i'm not importing correctly.
import java.lang.String; public class Looparray { public static void main(String args[] { for (String myStr= "Hello there!";;) { System.out.print (myStr); System.out.print(" "); } } }
I'm having a hard time with this problem, this is what I have, but I can not use two integers, I have to use one integer and a string...
This is the question:
Write a method called printStrings that accepts a String and a number of repetitions as parameters and prints that String the given number of times. For example, the call:
printStrings("abc", 5);
will print the following output: abcabcabcabcabc
This is what I attempted:
public class printStringsproject { public static void printStrings(int abc, int number) { for (int i = 1; i <= number; i++) { System.out.print("abc"); } } public static void main(String[] args) { printStrings(1, 5); } }
what will i compare in if statemet is the 1st letter of each if i have code="a" and name="Angelina" first letter of each is "a" and "A" then in convert it to string so that i can make it uppercase but when i compare it in if statement it always go into "not x" but the ouput that im getting is x=A y=A then it always direct me into else statement.
String code = "a"; String name = "Angelina"; char c = code.charAt(0); char n = name.charAt(0);
import java.io.IOException; import java.util.*; public class Guesser { public static void main(String[] args) throws IOException { char[] alphabet = "abcdefghijklmnopqrstuvwxyz1234567890 .,:;'-".toCharArray();
[Code] .....
I'm writing a program which will take a three letter word (for now) and then try to guess the word over and over again until it finds it, then print the word and the amount of tries it took to find it.
The problem: at the moment the program will find the word but not break out of the for loop when it does. I think it doesn't like the char to String conversion somewhere along the line.
I want to cut my string from space char but i am getting exception....
Java Code:
import java.util.Scanner; import java.util.StringTokenizer; public class NameSurname { public static void main(String args[]) { Scanner sc=new Scanner(System.in); String s0,s1=null,s2 = null,s3=null; s0=sc.next();
[Code] ....
Console: Lionel andres messi Exception in thread "main" java.util.NoSuchElementException at java.util.StringTokenizer.nextToken(Unknown Source) at java.util.StringTokenizer.nextToken(Unknown Source) at com.parikshak.NameSurname.main(NameSurname.java:15) mh_sh_highlight_all('java'); I/p -O/p:
my s0=Lionel andres Messi
And I want to break it as soon as i find space and save it in s1,s2 and s3
I'm trying to find a word in an array of char.....but I'm stuck. How to formulate the code to step through the array and pick out the word. This is what I have so far...
public static void searchAcross(String string, char[][] puzzle) { // Gets the number of rows in the matrix int rowLength = puzzle.length; //Gets the number of columns in the matrix. int colLength = puzzle[0].length;
What I'm trying to do is compare String input to a char array. Let me make it a little more plain, I'm working on a cipher assignment, and my line of thought is this: I will get String input from the user, COMPARE the characters in the string input to an alphabet array, which will then be compared to the cipher array so that the cipher's counterpart can be chosen over the alphabet's. Any way that I might compare the random input keyed in by the user to that alphabet array?
I am trying to figure out how to convert a string of ASCII code into char.I know that you can use (char) to convert it, but the issue is you cannot really just it for Strings.
Error:public String front3(String str) { ^^^^^^^^^^^^^^^^^^ This method must return a result of type String
Possible problem: the if-statement structure may theoretically allow a run to reach the end of the method without calling return. Consider adding a last line in the method return some_value; so a value is always returned.
public static void main(String[]args) { Scanner input = new Scanner(System.in); System.out.print("Type your text: "); String text = input.nextLine(); int counter = text.length(); if(text.length()> 16)
[Code] ....
And input is: abcdefghijklm
output is:
Java Code:
a b c d e f g h i j k l m x x x mh_sh_highlight_all('java');
So all i want is, if i type: abcdefghijklm
I want this output:
Java Code:
a e i m b f j x c g k x d h l x mh_sh_highlight_all('java');
Write a program using a while-loop (and a for-loop) that asks the user to enter a string, and then asks the user to enter a character. The program should count and display the number of times that the specified character appears in the string. (So, you will have two separate program codes, one using a while-loop and the other one using a for-loop.)
Example: Enter a string: "Hello, JAVA is my favorite programming language." Enter a character: e The number of times the specified character appears in the string: 3
I don't even know where to begin I've only got this
import java.util.Scanner; public class letterCounter { public static void main(String [] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter a string"); String myString = sc.nextLine(); System.out.println("Enter a letter"); String letter = sc.nextLine(); } }
I'm trying to come up with a method that would validate each turn a player makes. For a turn to be valid, it has to only contain numbers from 0 to 3(inclusive) and at least one digit must not be 0. Here is what I`ve come up with so far. For example, with "303" as the number and "101" as the turn, the turn would be valid and my method should return true, but it does not.
public static boolean turnIsValid (String number, String turn ){ boolean rep=false; int pos1=0; char min='0'; char max='3'; while(number.length()==turn.length()&&pos1<turn.length()){
I have an assignment and one of the prompts is to do a binary search on an array if and only if the array of Strings is sorted. The binary search part I think I have completed, but it is the sorted array check that is throwing everything off. If the array is already sorted, return true; else, return false.
// Check if the array is sorted public static boolean isSorted(String[] arr) { //for (int i = 0; i < arr.length-1; i++) //{ //if (arr[i].compareTo(arr[i+1]) > 0) //return false; //} String[] arrSorted = arr; Arrays.sort(arrSorted);
I am making a function to search through the whole inventory to see if any of the Lamborghini object has a certain model name such as aventador, diablo, etc....
This is what I have but I figured there's a big mistake when I make it true / false; it's making it going through the list and what's return is the last one instead of saying there's such match in the whole list or not.
public boolean hasCarModel(String modelName){ boolean exist = false; for (Lamborghini lambo : inventory){ String carModelName = lambo.getModelName(); if(carModelName.equalsIgnoreCase(modelName)){
[Code] ....
I figured if I add break; under exist = true; it'll work because as soon as it found one match then it'll turn to true and break out the loop but I don't think this is the best way to do it right?
I'm supposed to use stacks (implemented with an array) to check to see if a string is a palindrome. I've finished all my classes and methods, but I'm getting an ArrayIndexOutOfBoundsException when I try to run my demo program.Here are my classes:
public interface Stack { // Creates an empty stack public void initializeStack() // Returns true if the stack is empty, returns false otherwise public boolean isEmpty(); // The stack can never be full, so always return false public boolean isFullStack();
