Question
I need help with this C++ programming problem. Please note, this is C++, not Java language:
Here are the steps to help you code this problem:
Another sample output so you can display the correct messages:
Please check your codes thoroughly before you post your answers. You should test your codes with the sample out above: She worked hard to build the deck just right,. or anything else. Once the total score adds up that makes sense, your codes are good. Please pay attention to the details in the problems (such as no for loops can be used, and so on). Thanks a lot!
Write a program scrabbl the number of occurrences of the following letters: 'e', 'd', 'c', 'h', "k, and j' in the text, and determines a total score for the text using a point based scheme. Both lower case and upper case letters should be counted together. When a period, "', or exclamation mark, "!, appears in the input text, the program prints how many of each letter above only, the total score of the text (see point assignments below), and halts. Each letter being counted is assigned a score (similar to the e game.cpp that reads in text one character at a time and counts
Explanation / Answer
#include "letters.hpp" Letters Letters::lettersInstance; Letters * Letters::getInstance() { return &lettersInstance; } Letters::Letters() { // the number of letters remaining numLetters = 100; // the number of each letter remaining letBlank = 2; letA = 9; letE = 12; letI = 9; letO = 8; letN = 6; letR = 6; letT = 6; letL = 4; letS = 4; letU = 4; letD = 4; letG = 3; letB = 2; letC = 2; letM = 2; letP = 2; letF = 2; letH = 2; letV = 2; letW = 2; letY = 2; letK = 1; letJ = 1; letX = 1; letQ = 1; letZ = 1; // note this does not contain blank letters lettersArr[0] = letA; lettersArr[1] = letB; lettersArr[2] = letC; lettersArr[3] = letD; lettersArr[4] = letE; lettersArr[5] = letF; lettersArr[6] = letG; lettersArr[7] = letH; lettersArr[8] = letI; lettersArr[9] = letJ; lettersArr[10] = letK; lettersArr[11] = letL; lettersArr[12] = letM; lettersArr[13] = letN; lettersArr[14] = letO; lettersArr[15] = letP; lettersArr[16] = letQ; lettersArr[17] = letR; lettersArr[18] = letS; lettersArr[19] = letT; lettersArr[20] = letU; lettersArr[21] = letV; lettersArr[22] = letW; lettersArr[23] = letX; lettersArr[24] = letY; lettersArr[25] = letZ; } // This method will pick n letters from the remaining letters and then return them as a letter group int* Letters::pickLetters(int n) { // if not enough letters left return what we have if (n > numLetters) { n = numLetters; } int * returnArr; returnArr = new int[n]; for (int i = 0; i