main.cpp File Reference

#include <bits/stdc++.h>

Include dependency graph for main.cpp:

Go to the source code of this file.

Data Structures
struct	ListNode
	Definition for singly-linked list. More...
class	Solution

Functions
ListNode *	create_list (const vector< int > &array, int pos)
void	print_list (ListNode *head)
void	delete_list (ListNode *head, set< ListNode * > *handled=NULL)
int	main ()

Function Documentation

create_list()

ListNode * create_list	(	const vector< int > &	array,
		int	pos
	)

Definition at line 15 of file main.cpp.

{
    if (array.size() == 0)
        return NULL;
    ListNode* head = new ListNode(array[0]);
    ListNode* current = head;
    ListNode* cycling_node = NULL;
    for (int i = 1; i < (int)array.size(); ++i)
    {
        current->next = new ListNode(array[i]);
        current = current->next;
        if (i == pos)
            cycling_node = current;
    }
    if (pos == 0)
        current->next = head;
    else
        current->next = cycling_node;
    return head;
}

References ListNode::next.

Referenced by main().

delete_list()

void delete_list	(	ListNode *	head,
		set< ListNode * > *	handled = NULL
	)

Definition at line 52 of file main.cpp.

{
    bool created = false;
    if (!handled)
    {
        handled = new set<ListNode*>;
        created = true;
    }
    handled->insert(head);
    if (handled->find(head->next) == handled->end() && head->next)
        delete_list(head->next, handled);
    delete head;
    if (created)
        delete handled;
}

References delete_list(), and ListNode::next.

Referenced by delete_list(), and main().

main()

int main

(

)

Definition at line 112 of file main.cpp.

{
    vector<int> input = {3,2,0,-4};
    int pos = 1;
    ListNode* head = create_list(input, pos);
    print_list(head);
 
    cout << "Does the list contain a cycle? " << Solution().hasCycle(head) << endl;
 
    delete_list(head);
    return 0;
}

References create_list(), delete_list(), Solution::hasCycle(), and print_list().

print_list()

void print_list

(

ListNode *

head

)

Definition at line 36 of file main.cpp.

{
    ListNode* current = head;
    set<ListNode*> visited;
    while (current != NULL)
    {
        if (visited.find(current) != visited.end())
            break;
        visited.insert(current);
        cout << current->val << endl;
        current = current->next;
    }
    if (current) // if cycle exists
        cout << "next in cycle: " << current->val << endl;
}

References ListNode::next, and ListNode::val.

Referenced by main().