lab4.tar

list.h0000600006513700162730000000214014314753375011760 0ustar  lsmit248lsmit248/* Laura Smith 9/28/2022  1:09 AM  list.h 40 lines
Lab 4 CS 202 Adding List-Based Intergers 
This header file initilizes things for the node and list classes.
Node class just worries about the nodes or the chains of the linked
lists, each chain has a number and a pointer to the next chain.
List initialized functions used to make the linked lists and then add
them together later.
*/

#include <iostream>
#include <string>
#include <cstdio>

//start of Node class
class Node {
	public:			//public functions to make the nodes
		Node(int);	//function to make the node which takes an int
		int data;	//number of the node
		Node *next;	//pointer to next node
};
//end of Node class

//start of List class
class List {

	private:				
		Node *head;			//private pointer to the head
		Node *newNode(int);	//private function to only use in list.cpp to make a new node
        int count;			//used in getCount

	public:					//public function initilizations
		List();				//constructor
		~List();			//deconstructor
		void addNode(int);	
		int empty();		
		int getCount();		
		Node *getHead();	
		void print();
};
//end of List classlist.cpp0000600006513700162730000000551514314753376012325 0ustar  lsmit248lsmit248/* Laura Smith 9/28/2022  1:09 AM  list.cpp 105 lines
Lab 4 CS 202 Adding List-Based Intergers 
This creates the functions that were initialized in the header file. The node
function just creates the nodes of the linked list which each node has data and 
a pointer to the next node. For list there is a constructor and deconstructor along 
with functions to help in main. It initiates the functions newNode, addNode, empty, 
getCount, getHead, and print. In print I also learned how to use strings and push_back better.
*/

#include "list.h"
#include <string>
#include <sstream>

using namespace std;

//start of Node functions
Node::Node(int i) {
	data = i;
	next = NULL;
}
//end of Node functions

//start of List functions
List::List() {
	head = NULL;
	count = 0;
}

//copied Dr. Emrich's function
List::~List() {
	if (!empty()) { 				// follow the links, clobbering as we go
		Node *p = head;

		while (p != NULL) {
			Node *next = p->next; 	// retrieve this node's "next" before we clobber it
			delete p;
			p = next;
		}
	}
}

//helper function to create a new node
Node *List::newNode(int i) {
	Node *node = new Node(i);
	node->next = NULL;
	return node;
}

//copied Dr. Emrich's function 
void List::addNode(int i) {
    Node *node; 				//creates a node pointer to the linked list

        if (head == NULL){  	//if this is a new list and it is empty, calls newNode
            head = newNode(i);
        }
        else { 					//otherwise it adds the inputed value into the next node on the list
            for(node=head; node->next != NULL; node = node->next);
            node->next = newNode(i);
        }
}

//function to check if a list is empty
int List::empty() {
	if (head != NULL) 	//if it has stuff in it
        return(false);
    else              	//if it doesn't have stuff in it
        return(true);
}

int List::getCount() {
	Node *node;			//make a pointer to the head node
    int count = 0;		//int to keep track of the count

    for (node = head; node->next != NULL; node = node->next) 
        count++;		//for loop goes through each node and just adds to count for each node
    
    return (count);
}

//returns pointer to the first node/ the head
Node *List::getHead() {
	return (head);
}

//function to print out the linked lists in the correct order
void List::print() {
	if (!empty()) { 
			
		string numPrint;			//string of the numbers to use later

		if (!empty()){
			Node *node = head;		//pointer to the head of the linked list
			while(node != NULL){	//until the list reaches the end, it pushes the list's data into the string
				numPrint.push_back(node->data + '0');
				node = node->next;
			}
			for (int i = numPrint.size()-1; i>=0; i--){
				cout << numPrint[i]; //for loop to go through the string to print it out to the screen
			}
		}
	}
	else
		printf("empty\n"); 			//if the linked list is empty it returns as empty
}
//end of List functionsmain.cpp0000600006513700162730000000770414314753373012275 0ustar  lsmit248lsmit248/* Laura Smith 9/28/2022  1:09 AM  main.cpp 133 lines
Lab 4 CS 202 Adding List-Based Intergers 
First is the sumList function which actually adds together the lists, while
in main the lists are created and then sumList is called for them. I learned
how to use node pointers and the other syntax related to linked lists.
*/

#include "list.h"
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>

using namespace std;

//helper function to add contents of list
List *sumLists(List *list1, List *list2) {
   
    int carry = 0;  //The carried value, should always be 1 or 0
    int value = 0;  //The value getting put into the answer linked list
    
    List *list3 = new List; //answer linked list

    //pointers to the head of both numbers
    Node *node1 = list1->getHead();
    Node *node2 = list2->getHead();
    
    //if either of the lists are empty, just return the other list
    if (list1->empty()){
        return list2;
    }
    else if (list2->empty()){
        return list1;
    }

    //while loop which goes through until both numbers are at the end
    while (node1 != NULL || node2 != NULL){

        //these keep track of the current value of each list
        int val1 = 0;
        int val2 = 0;

        //both of these if/else statements check if it's at the end
        //when at the end it sets the current value of the list at 0
        //if it has a value, it sets the current value to it and then goes to the next node in the list
        if (node1 == NULL)
            val1 = 0;
        else{
            val1 = node1->data;
            node1 = node1->next;
        }

        if (node2 == NULL)
            val2 = 0;
        else {
            val2 = node2->data;
            node2 = node2->next;
        }

        //this caculates the value that goes into the answer list
        //carried value, and the data from the same point in the lists are added
        value = carry + val1 + val2;

        //if the value is over 9 then 1 will have to be carried and value is only the remainder
        //if not over nine the carry value is set back to 0
        if (value > 9){
            carry = 1;
            value = value % 10;
        }
        else 
            carry = 0;

        //finally adds the final value to the answer list
        list3->addNode(value);
    }

    //if carry is over 0 after both lists are at the end, it adds one to the end of the answer linked list
    if (carry > 0)
        list3->addNode(carry);

    //returns the answer linked list
    return list3;
}

int main(int argc, char *argv[]) {
    
    string Digits;  //string of the inputed line of numbers

    while (getline(cin, Digits)){   //while loop goes as long as there is input
        
        //puts the numbers into digits
        istringstream sin(Digits);

        //puts each number into it's own string
        string num1;
        sin >>  num1;

        string num2;
        sin >> num2;

        //list pointers to make linked lists for both numbers and the answer list
        List *list1 = new List;
        List *list2 = new List;
        List *list3;

        //these keep track of the length of each number
        int size1 = num1.size();
        int size2 = num2.size();

        //for loops to go through each number string to put it into a linked list backwards
        for (int i = 1; i <= size1; i++){
            int digit = (int)num1[size1 - i];   //starts at the last number and goes to the first
            list1->addNode(digit - 48);         //-48 to translate from ASCII to int
        }

        for (int i = 1; i <= size2; i++){
                int digit = (int)num2[size2 - i];
                list2->addNode(digit - 48);
            }
        
        //puts the answer list into list3 and then prints it
        list3 = sumLists(list1, list2);
        list3->print();
        cout << endl;

        //these delete anything new was called on, which are the three linked lists
        delete list1;
        delete list2;
        delete list3;
    }

	return 0;
}