代码搜索：ListNode
找到约 740 项符合「ListNode」的源代码
代码结果 740
www.eeworm.com/read/155753/11851357
c dataprocess.c
#include "myStd.h"
#include "main.h"
#include "util.h"
#include "dataProcess.h"
int FindBook(ListNode* pLstHeader, char* pID)
{
int nRet = 0;
ListNode* pLstTmp = pLstHeader;
while(pLs
www.eeworm.com/read/155753/11851390
c util.c
#include "myStd.h"
#include "util.h"
ListNode* ListAddTail(ListNode* pList, DATATYPE* pData, int nMemLen)
{
if(pList!=NULL)
{
ListNode* pNewNode = (ListNode*)malloc(sizeof(ListNode));
L
www.eeworm.com/read/155673/11855917
java liststack.java
package com.he.java;
import java.io.*;
import com.he.java.*;
public class ListStack
{
private LinkList theStack;
public ListStack()
{
this.theStack =new LinkList();
}
public int getS
www.eeworm.com/read/155673/11855921
java linklist.java
package com.he.java;
import java.io.*;
import com.he.java.*;
public class LinkList
{
public ListNode Header;
public int LinkListLength;
public LinkList()
{
Header = new ListNode (null
www.eeworm.com/read/155673/11855923
java listqueue.java
package com.he.java;
import java.io.*;
import com.he.java.*;
public class ListQueue
{
public LinkList theQueue;
public ListQueue()
{
this.theQueue = new LinkList();
}
public int getLe
www.eeworm.com/read/154781/11926685
java linkedlist.java
package Josephus;
public class LinkedList
{
public LinkedList()
{
header = new ListNode(0, header);
}
public boolean isEmpty()
{
return header.next == null;
}
public void
www.eeworm.com/read/154781/11926688
java linkedlistitr.java
package Josephus;
public class LinkedListItr
{
LinkedListItr(ListNode theNode)
{
current = theNode;
}
public boolean isPastEnd()
{
return current == null;
}
public int re
www.eeworm.com/read/257293/11934779
c sort_listinsert.c
/* 表插入排序的算法源程序*/
#include
struct Node; /* 单链表结点类型 */
typedef int KeyType;
typedef int DataType;
typedef struct Node ListNode;
struct Node {
KeyType key;
www.eeworm.com/read/257117/11949541
cpp 单链表.cpp
#include
class listnode//结点描述
{
public:
int data;
listnode *next;
listnode(const int &itemval,listnode *ptrnext=NULL)//构造函数
{
data=itemval;
next=ptrnext;
}
listnode(li
www.eeworm.com/read/153920/12000005
cpp downloadlist.cpp
#include ".\downloadlist.h"
#include "NetFlowrecoder.h"
CDownloadList::CDownloadList(void)
{
}
CDownloadList::~CDownloadList(void)
{
//删除队列,未完成.
}
bool CDownloadList::AddTask(LPTSTR