1
0
Fork 0

Week 4: Assignment - Stacks & Queues

This commit is contained in:
Llewellyn van der Merwe 2020-09-26 20:32:18 +02:00
parent a910b6f7a7
commit f91707048d
Signed by: Llewellyn
GPG Key ID: EFC0C720A240551C
4 changed files with 1290 additions and 0 deletions

6
week-04-1/CMakeLists.txt Normal file
View File

@ -0,0 +1,6 @@
cmake_minimum_required(VERSION 3.16)
project(week-04-1)
set(CMAKE_CXX_STANDARD 17)
add_executable(week-04-1 main.cpp)

1176
week-04-1/main.cpp Normal file

File diff suppressed because it is too large Load Diff

6
week-04-2/CMakeLists.txt Normal file
View File

@ -0,0 +1,6 @@
cmake_minimum_required(VERSION 3.16)
project(week-04-2)
set(CMAKE_CXX_STANDARD 14)
add_executable(week-04-2 main.cpp)

102
week-04-2/main.cpp Normal file
View File

@ -0,0 +1,102 @@
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Champlain College SDEV-345-81
*
* C++ Week 4: Discussion (first semester) - Stack (2020/09/20)
*
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
*
* The program should input a sentence from the user as a string,
* then put it character by character into the stack and spit it out in reverse order.
*
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
*
* Written by Llewellyn van der Merwe <llewellyn.vandermerw@mymail.champlain.edu>, September 2020
* Copyright (C) 2020. All Rights Reserved
* License GNU/GPL Version 2 or later - http://www.gnu.org/licenses/gpl-2.0.html
*
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
// Adaptation to the code found at
// Week 4: Lecture 5 - Reversing A Word
// We use Stack to Reverse a Sentence
#include <iostream>
#include <vector>
#include <string>
using namespace std;
////////////////////////////////////////////////////////////////
class StackX {
private:
int maxSize;
vector<char> stackVect; // vector holds stack
int top;
public:
//--------------------------------------------------------------
StackX(int max) : maxSize(max), top(-1) // constructor
{
stackVect.resize(maxSize); // size the vector
}
//--------------------------------------------------------------
void push(char j) // put item on top of stack
{ stackVect[++top] = j; }
//--------------------------------------------------------------
char pop() // take item from top of stack
{ return stackVect[top--]; }
//--------------------------------------------------------------
char peek() // peek at top of stack
{ return stackVect[top]; }
//--------------------------------------------------------------
bool isEmpty() // true if stack is empty
{ return (top == -1); }
//--------------------------------------------------------------
}; //end class StackX
////////////////////////////////////////////////////////////////
class Reverser {
private:
string input; // input string
string output; // output string
public:
//--------------------------------------------------------------
Reverser(string in) : input(in) // constructor
{}
//--------------------------------------------------------------
string doRev() // reverse the word
{
int stackSize = input.length(); // get max stack size
StackX theStack(stackSize); // make stack
for (int j = 0; j < input.length(); j++) {
char ch = input[j]; // get a char from input
theStack.push(ch); //push it
}
output = "";
while (!theStack.isEmpty()) {
char ch = theStack.pop(); // pop a char,
output = output + ch; // append to output
}
return output;
} //end doRev()
//--------------------------------------------------------------
}; //end class Reverser
////////////////////////////////////////////////////////////////
int main() {
string input, output;
while (true) {
cout << "Enter a sentence: ";
getline(cin, input); // read a word from kbd
if (input.length() < 2) // quit if one character
break;
//make a Reverser
Reverser theReverser(input);
output = theReverser.doRev(); // use it
cout << "Reversed: " << output << endl;
} //end while
return 0;
}