oreodave/algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

(list)~NULL -> nullptr

Browse Source 
C++ styling.
This commit is contained in:
Aryadev Chavali
2021-11-22 05:52:49 +00:00
parent 36d5eb111a
commit 1537bb705b
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
list.cpp
View File

@@ -15,7 +15,7 @@ struct List
~List() ~List()
{ {
if (next == NULL) if (next == nullptr)
return; return;
delete next; delete next;
} }
@@ -25,31 +25,31 @@ template <typename T>
List<T> *append(List<T> *lst, T value) List<T> *append(List<T> *lst, T value)
{ {
List<T> *node; List<T> *node;
if (lst == NULL) if (lst == nullptr)
{ {
node = new List<T>; node = new List<T>;
node->value = value; node->value = value;
node->next = NULL; node->next = nullptr;
return node; return node;
} }
for (node = lst; node->next != NULL; node = node->next) for (node = lst; node->next != nullptr; node = node->next)
continue; continue;
node->next = new List<T>; node->next = new List<T>;
node->next->value = value; node->next->value = value;
node->next->next = NULL; node->next->next = nullptr;
return lst; return lst;
} }
/** Reverse a list /** Reverse a list
*/ */
template <typename T> template <typename T>
List<T> *reverse(List<T> *lst, List<T> *prev = NULL) List<T> *reverse(List<T> *lst, List<T> *prev = nullptr)
{ {
auto next = lst->next; auto next = lst->next;
lst->next = prev; lst->next = prev;
if (next == NULL) if (next == nullptr)
return lst; return lst;
return reverse(next, lst); return reverse(next, lst);
} }
@@ -65,7 +65,7 @@ std::ostream& operator<<(std::ostream& ostream, const List<T> *lst)
int main(void) int main(void)
{ {
auto lst = append<int>(NULL, 1); auto lst = append<int>(nullptr, 1);
for (int i = 2; i < 10; ++i) for (int i = 2; i < 10; ++i)
lst = append(lst, i); lst = append(lst, i);
std::cout << lst << std::endl; std::cout << lst << std::endl;