OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: changed the data types

Browse Source
This commit is contained in:
Tishasoumya-02 2021-09-11 10:18:25 +05:30
parent 7469415279
commit 3b2e68c22b
1 changed files with 16 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
data_structures/reverse_a_linked_list.cpp
View File

@ -1,11 +1,12 @@
/** /**
* @file * @file
* @brief Implementation of reversing a single linked list algorithm. * @brief Implementation of [Reversing
* a single linked list](https://simple.wikipedia.org/wiki/Linked_list)
* @details * @details
* The linked list is a data structure used for holding a sequence of * The linked list is a data structure used for holding a sequence of
* values, which can be added, displayed,reversed or removed. * values, which can be added, displayed,reversed, or removed.
* ### Algorithm * ### Algorithm
* Values can be added by iterating to the end of a list(by following * Values can be added by iterating to the end of a list (by following
* the pointers) starting from the first link. Whichever link points to null * the pointers) starting from the first link. Whichever link points to null
* is considered the last link and is pointed to the new value. * is considered the last link and is pointed to the new value.
* *
@ -16,7 +17,8 @@
* happens. And then we move the prev and current pointers one step forward. * happens. And then we move the prev and current pointers one step forward.
* Then the head node is made to point to the last node (prev pointer) after * Then the head node is made to point to the last node (prev pointer) after
* completion of an iteration. * completion of an iteration.
* Graphic Explanation:https://bit.ly/3nbVrFe * Graphic Explanation:https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing
*
*/ */
#include <cassert> /// for assert #include <cassert> /// for assert
#include <iostream> /// for I/O operations #include <iostream> /// for I/O operations
@ -37,7 +39,7 @@ namespace linked_list {
*/ */
class Node { class Node {
public: public:
int val; /// value of the current link int32_t val; /// value of the current link
Node *next; /// pointer to the next value on the list Node *next; /// pointer to the next value on the list
}; };
@ -58,8 +60,8 @@ class list {
void insert(int32_t new_elem); void insert(int32_t new_elem);
void reverseList(); void reverseList();
void display(); void display();
int top(); int32_t top();
int last(); int32_t last();
}; };
/** /**
@ -114,12 +116,12 @@ void list::reverseList() {
/** /**
* function to find the top element of the list * function to find the top element of the list
* @returns 'int n' * @returns 'int32_t n'
* @brief returns the first element in the list * @brief returns the first element in the list
*/ */
int list::top() { int32_t list::top() {
if (!isEmpty()) { if (!isEmpty()) {
int n = head->val; int32_t n = head->val;
return n; return n;
} else { } else {
return 0; return 0;
@ -127,10 +129,10 @@ int list::top() {
} }
/** /**
* function to find the last element of the list * function to find the last element of the list
* @returns 'int t->val' * @returns 'int32_t t->val'
* @brief returns the last element of the list * @brief returns the last element of the list
*/ */
int list::last() { int32_t list::last() {
if (!isEmpty()) { if (!isEmpty()) {
Node *t = head; Node *t = head;
while (t->next != nullptr) { while (t->next != nullptr) {
@ -156,8 +158,8 @@ static void test() {
L.insert(12); L.insert(12);
L.insert(15); L.insert(15);
L.insert(10); L.insert(10);
L.insert(12); L.insert(-12);
L.insert(20); L.insert(-20);
L.insert(18); L.insert(18);
assert(L.top() == 11); assert(L.top() == 11);
assert(L.last() == 18); assert(L.last() == 18);