Vwwxrf

Are Roman Catholic priests ever addressed as pastor

Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?

What are substitutions for coconut in curry?

Is "upgrade" the right word to use in this context?

Relationship between sampajanna definitions in SN 47.2 and SN 47.35

How to write cleanly even if my character uses expletive language?

How could a scammer know the apps on my phone / iTunes account?

What options are left, if Britain cannot decide?

Why did it take so long to abandon sail after steamships were demonstrated?

New passport but visa is in old (lost) passport

How do you talk to someone whose loved one is dying?

Is it normal that my co-workers at a fitness company criticize my food choices?

Are ETF trackers fundamentally better than individual stocks?

Aluminum electrolytic or ceramic capacitors for linear regulator input and output?

What is "focus distance lower/upper" and how is it different from depth of field?

As a new Ubuntu desktop 18.04 LTS user, do I need to use ufw for a firewall or is iptables sufficient?

Is there a place to find the pricing for things not mentioned in the PHB? (non-magical)

If I can solve Sudoku, can I solve the Travelling Salesman Problem (TSP)? If so, how?

Book: Young man exiled to a penal colony, helps to lead revolution

How do I hide Chekhov's Gun?

How to pronounce "I ♥ Huckabees"?

This word with a lot of past tenses

Examples of transfinite towers

How to explain that I do not want to visit a country due to personal safety concern?

Calculate the frequency of characters in a string

Return a string without the first two charactersCalculate all possible combinations of given charactersDelete the characters of one string from another stringBasic string compression counting repeated charactersString 'expanding' - reinserting repeating charactersFrequency counter utility classWord separator and Pig Latin program - final editCalculate the running medianPerform basic string compression using the counts of repeated charactersProgram to compress a string of characters

0

$begingroup$

Problem

I wrote this program to check the number of times that each letter appears in a string input by the user. It works fine, but is there a more efficient or alternative solutions of going about this task than reiterating through a twenty-six-element-long array for every single character?

Code

import java.util.Scanner;
public class Letters 
 public static void main(String[] args) 
 @SuppressWarnings("resource")
 Scanner sc = new Scanner(System.in);
 char[] c = 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z';
 int[] f = 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;
 System.out.println("Enter a string.");
 String k = sc.nextLine();
 String s = k.toUpperCase();
 s = s.trim();
 int l = s.length();
 System.out.println("Checking string = " + s);
 char ch;
 for (int i = 0; i < l; i++) 
 ch = s.charAt(i);
 for (int j = 0; j < c.length; j++) 
 if (ch == c[j]) 
 f[j]++;
 
 
 
 System.out.println("ChartFreq");
 for (int i = 0; i < c.length; i++) 
 if (f[i] != 0) 
 System.out.println(c[i] + "t" + f[i]);
 
 
 

java

share

asked 5 mins ago

Artemis HunterArtemis Hunter

11

New contributor

Artemis Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

Problem

I wrote this program to check the number of times that each letter appears in a string input by the user. It works fine, but is there a more efficient or alternative solutions of going about this task than reiterating through a twenty-six-element-long array for every single character?

Code

import java.util.Scanner;
public class Letters 
 public static void main(String[] args) 
 @SuppressWarnings("resource")
 Scanner sc = new Scanner(System.in);
 char[] c = 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z';
 int[] f = 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;
 System.out.println("Enter a string.");
 String k = sc.nextLine();
 String s = k.toUpperCase();
 s = s.trim();
 int l = s.length();
 System.out.println("Checking string = " + s);
 char ch;
 for (int i = 0; i < l; i++) 
 ch = s.charAt(i);
 for (int j = 0; j < c.length; j++) 
 if (ch == c[j]) 
 f[j]++;
 
 
 
 System.out.println("ChartFreq");
 for (int i = 0; i < c.length; i++) 
 if (f[i] != 0) 
 System.out.println(c[i] + "t" + f[i]);
 
 
 

java

share

asked 5 mins ago

Artemis HunterArtemis Hunter

11

New contributor

Artemis Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

Problem

I wrote this program to check the number of times that each letter appears in a string input by the user. It works fine, but is there a more efficient or alternative solutions of going about this task than reiterating through a twenty-six-element-long array for every single character?

Code

import java.util.Scanner;
public class Letters 
 public static void main(String[] args) 
 @SuppressWarnings("resource")
 Scanner sc = new Scanner(System.in);
 char[] c = 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z';
 int[] f = 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;
 System.out.println("Enter a string.");
 String k = sc.nextLine();
 String s = k.toUpperCase();
 s = s.trim();
 int l = s.length();
 System.out.println("Checking string = " + s);
 char ch;
 for (int i = 0; i < l; i++) 
 ch = s.charAt(i);
 for (int j = 0; j < c.length; j++) 
 if (ch == c[j]) 
 f[j]++;
 
 
 
 System.out.println("ChartFreq");
 for (int i = 0; i < c.length; i++) 
 if (f[i] != 0) 
 System.out.println(c[i] + "t" + f[i]);
 
 
 

java

share

asked 5 mins ago

Artemis HunterArtemis Hunter

11

New contributor

Artemis Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

import java.util.Scanner;
public class Letters 
 public static void main(String[] args) 
 @SuppressWarnings("resource")
 Scanner sc = new Scanner(System.in);
 char[] c = 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z';
 int[] f = 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;
 System.out.println("Enter a string.");
 String k = sc.nextLine();
 String s = k.toUpperCase();
 s = s.trim();
 int l = s.length();
 System.out.println("Checking string = " + s);
 char ch;
 for (int i = 0; i < l; i++) 
 ch = s.charAt(i);
 for (int j = 0; j < c.length; j++) 
 if (ch == c[j]) 
 f[j]++;
 
 
 
 System.out.println("ChartFreq");
 for (int i = 0; i < c.length; i++) 
 if (f[i] != 0) 
 System.out.println(c[i] + "t" + f[i]);
 
 
 

share

asked 5 mins ago

Artemis HunterArtemis Hunter

11

New contributor

Artemis Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

asked 5 mins ago

Artemis HunterArtemis Hunter

11

New contributor

Artemis Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 5 mins ago

Artemis HunterArtemis Hunter

11

New contributor

Artemis Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 5 mins ago

Artemis HunterArtemis Hunter

11