代码搜索：ListNode
找到约 740 项符合「ListNode」的源代码
代码结果 740
www.eeworm.com/read/212828/15148393
c 5-2.c
#include
#define N 10
typedef char datatype;
typedef struct node{
datatype data;
struct node *next;
} listnode;
typedef listnode *linklist;
listnode *p;
linklist cre
www.eeworm.com/read/212828/15148398
c 5-1.c
#include
typedef char datatype;
typedef struct node{
datatype data;
struct node *next;
} listnode;
typedef listnode *linklist;
listnode *p;
linklist createlist(void)
www.eeworm.com/read/212828/15148401
c 5-7.c
#include
typedef char datatype;
typedef struct node{
datatype data;
struct node *next;
} listnode;
typedef listnode *linklist;
listnode *p;
linklist createlist(void)
www.eeworm.com/read/212506/15155188
cpp recurve.cpp
//递归运算(栈的应用)Recurve.cpp
#include
#include
class list;
class listnode{
friend class list;
int data;
listnode *link;
listnode(int value,listnode *zz):data(value)
www.eeworm.com/read/212114/15165778
java list.java
// Fig. 20.3: List.java
// ListNode and List class definitions.
package com.deitel.jhtp5.ch20;
// class to represent one node in a list
class ListNode {
// package access members; List can a
www.eeworm.com/read/208576/15243629
h list.h
// Fig. 21.4: List.h
// Template List class definition.
#ifndef LIST_H
#define LIST_H
#include
using std::cout;
#include
#include "Listnode.h" // ListNode class definition
www.eeworm.com/read/208576/15243632
h list.h
// Fig. 21.4: List.h
// Template List class definition.
#ifndef LIST_H
#define LIST_H
#include
using std::cout;
#include
#include "Listnode.h" // ListNode class definition
www.eeworm.com/read/208576/15243638
h list.h
// Fig. 21.4: List.h
// Template List class definition.
#ifndef LIST_H
#define LIST_H
#include
using std::cout;
#include
#include "Listnode.h" // ListNode class definition
www.eeworm.com/read/208576/15243644
h list.h
// Fig. 21.4: List.h
// Template List class definition.
#ifndef LIST_H
#define LIST_H
#include
using std::cout;
#include "Listnode.h" // ListNode class definition
template< typ
www.eeworm.com/read/208553/15244539
java stack.java
public class Stack
{
ListNode topOfStack;
public Stack()
{
topOfStack = null;
}
public Stack(ListNode t)
{
topOfStack = t;
}
public boolean isEmpty()
{
return topO