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

          瀋陽號驅逐艦 目录 接收與服役 配置反潛直升機 武進三型性能升級 歷史 除役 參考資料 外部連結 导航菜单Taiwan Air Power海疆老兵-陽字號驅逐艦沿革World Navies Today: Taiwan (Republic of China)DD-839 USS POWER

          波兰旗帜列表 目录 国旗 军旗 其他制服部门旗帜 特别国家机构船只 参考文献 外部链接 导航菜单Polskie flagi, chorągwie, bandery... [波兰旗帜、条幅、船旗等]原始内容Ustawa z dnia 31 stycznia 1980 r. o godle, barwach i hymnie Rzeczypospolitej Polskiej oraz o pieczęciach państwowychZarządzenie Ministra Obrony Narodowej z dnia 14 grudnia 2005 r. zmieniające zarządzenie w sprawie szczegółowych zasad używania znaków Sił Zbrojnych Rzeczypospolitej Polskiej oraz ustalenia innych znaków używanych w Siłach Zbrojnych Rzeczypospolitej PolskiejZarządzenie Ministra Obrony Narodowej z dnia 29 stycznia 1996 r. w sprawie szczegółowych zasad używania znaków Sił Zbrojnych Rzeczypospolitej Polskiej oraz ustalenia innych znaków używanych w Siłach Zbrojnych Rzeczypospolitej PolskiejUstawa z dnia 19 lutego 1993 r. o znakach Sił Zbrojnych Rzeczypospolitej PolskiejHistoria Marynarki Wojennej RP [波兰海军史]Rozporządzenie Ministra Spraw Wewnętrznych i Administracji z dnia 12 kwietnia 2002 r. w sprawie wzoru flagi oraz oznakowania jednostek pływających i statków powietrznych Straży GranicznejRozporządzenie Ministra Spraw Wewnętrznych i Administracji z dnia 18 kwietnia 2005 r. w sprawie wzoru flagi oraz oznakowania jednostek pływających i statków powietrznych PolicjiRozporządzenie Ministra Infrastruktury z dnia 21 października 2005 r. w sprawie wzorów flag dla statków morskich na oznaczenie pełnionej specjalnej służby państwowej oraz okoliczności i warunków ich podnoszenia波兰旗帜波兰

          Indenting and Dedenting ASP code with Python