Hello,
I'm quite stuck on this program...
Im supposed to do the following:
Have the user input a text, then output how many times the letter appears using Arrays and for loops.
Ex:
If the User inputed "Java"
The output would be:
a: 2
j: 1
v: 1
Ex 2:
If the User inputed "Java is cool"
The Output would be:
a: 2
c: 1
i: 1
j: 1
l: 1
o: 2
v: 1
Thank you!
Message was edited by:
JohnnyQ
Look at this example:
String testString = "CaptainMorgan08 is awesome!";
int numOfAs = 0;
for(int i=0; i<testString.length(); i++)
{
if(testString.toLowerCase().charAt(i) == 'a')
{
numOfAs++;
}
}
System.out.println("The number of As found: "+numOfAs);
>
> I had basically reached the same area that captain
> morgan had reached, i was just wondering if there was
> a way to do this program without using 26 FOR-LOOPS.
You might not have to. Create an array of chars like so:
char[] alphabet = {a, b, c, d, e, f, g, h, i...};
int[] numOfLetters[] = new int[26];
You could then have a nested for loop that loops through the alphabet.
I don't know why I even bother helping you as the last time I did, you didn't even seem to care. I gave you three perfectly good, working examples producing the output that you requested. In fact, that thread still has 10 dukes available. [url http://forum.java.sun.com/thread.jspa?threadID=788415&messageID=4480092#4480092] See this thread if you're curious.[/url]
As for this assignment, here is another example. Use it or don't use it, but at least be courteous enough to not ignore it this time.
public class CharCounter {
public static void main(String[] argv) {
String test = "This is a mother frickin test.";
int[] results = new int[26];
for (int i = 0; i < 26; i++) {
results[i] = 0;
}
char[] data = test.toLowerCase().toCharArray();
for (int j = 0; j < data.length; j++) {
if (data[j] >= 97) {
int t = data[j] - 97;
results[t]++;
}
}
for (int n = 0; n < results.length; n++) {
if (results[n] != 0) {
System.out.println(((char)(n + 97)) + ": " + results[n]);
}
}
}
}
> > [url
> http://forum.java.sun.com/thread.jspa?threadID=788415&
> messageID=4480092#4480092] See this thread if you're
> curious.[/url]
>
> That reminds me. I fixed Stringify, so its not
> getting deleted!
I saw that... checked on it a couple of days ago to see what ever happened to it. Happy to see that it's still there. ;-)
