Starting some programming with python at school now, and I don\'t know how to proceed with this problem. Any thoughts?
I use Java. I already have a class for a custom object called \"Subject\". I have another class that only contains a Linked List of Subject objects. (called subjectsList)
I have an unsorted linked list. I need to sort it by a certain field t开发者_运维百科hen return the linked list to its previous unsorted condition. How can I do this without making a copy of the list?
I have been trying to implement XOR linked list and its operations but I have not been able to do it properly.
Given two lists l1,l2, show how to merge them in O(1) time. The data structures for the lis开发者_StackOverflow社区ts depends on how you design it. By merging I mean to say union of the lists.
is there any standard approach which I\'ve missed at school to dump C structure with nested linked lists on disk in reasonable way?
This question already has answers here: Closed 12 years ago. Possible Duplicate: Copy a linked list Hello stackoverflow! I am trying to learn more about linked lists so I am trying to cr
Since long back I have not used C or C++ ,so forget completely about Pointers. I\'m familiar with C# and have written a basic version of this. Need to know whether I\'m doing right/wrong?
I\'m writing a program for a \"Set\" data structure in C. It\'s working fine when o开发者_如何学Cne instance of Set is present, but it doesn\'t work when two instances of Set are present.
Attached is a quick program written under interview conditions that is designed to flatten a doubly linked list with child links. I was wondering what folks thought and if there were some optimization
加载中,请稍侯......