Calculate the frequency of characters in a stringReturn 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

Bacteria contamination inside a thermos bottle

Most cost effective thermostat setting: consistent temperature vs. lowest temperature possible

What is the relationship between relativity and the Doppler effect?

Does .bashrc contain syntax errors?

Simplify an interface for flexibly applying rules to periods of time

How can we have a quark condensate without a quark potential?

Could the Saturn V actually have launched astronauts around Venus?

Are ETF trackers fundamentally better than individual stocks?

Is it good practice to use Linear Least-Squares with SMA?

What is a ^ b and (a & b) << 1?

What is the significance behind "40 days" that often appears in the Bible?

Have the tides ever turned twice on any open problem?

Relationship between sampajanna definitions in SN 47.2 and SN 47.35

Print a physical multiplication table

New passport but visa is in old (lost) passport

Did Ender ever learn that he killed Stilson and/or Bonzo?

Why do newer 737s use two different styles of split winglets?

While on vacation my taxi took a longer route, possibly to scam me out of money. How can I deal with this?

Knife as defense against stray dogs

What exactly is this small puffer fish doing and how did it manage to accomplish such a feat?

Do I need life insurance if I can cover my own funeral costs?

Adventure Game (text based) in C++

Are all passive ability checks floors for active ability checks?

Why does a Star of David appear at a rally with Francisco Franco?



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]);












share







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$
















    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]);












    share







    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$














      0












      0








      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]);












      share







      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$




      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







      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







      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



      share






      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 8 mins ago









      Artemis HunterArtemis Hunter

      11




      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.





      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.






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




















          0






          active

          oldest

          votes











          Your Answer





          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ifUsing("editor", function ()
          StackExchange.using("externalEditor", function ()
          StackExchange.using("snippets", function ()
          StackExchange.snippets.init();
          );
          );
          , "code-snippets");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "196"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );






          Artemis Hunter is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215592%2fcalculate-the-frequency-of-characters-in-a-string%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          Artemis Hunter is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          Artemis Hunter is a new contributor. Be nice, and check out our Code of Conduct.












          Artemis Hunter is a new contributor. Be nice, and check out our Code of Conduct.











          Artemis Hunter is a new contributor. Be nice, and check out our Code of Conduct.














          Thanks for contributing an answer to Code Review Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215592%2fcalculate-the-frequency-of-characters-in-a-string%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

          Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

          Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar