代码搜索：ListNode
找到约 740 项符合「ListNode」的源代码
代码结果 740
www.eeworm.com/read/208552/15244556
java stackli.java
public class StackLi {
private ListNode topOfStack;
public StackLi() {
}
public boolean isEmpty(){
return topOfStack==null;
}
public boolean isFull(){
return
www.eeworm.com/read/208552/15244566
java linkedlist.java
/**
* @(#)LinkedList.java
*
*
* @author
* @version 1.00 2006/10/29
*/
package Polynomial;
public class LinkedList {
public LinkedList()
{
header=new ListNode(nu
www.eeworm.com/read/208552/15244568
java linkedlistitr.java
/**
* @(#)LinkedListItr.java
*
*
* @author
* @version 1.00 2006/10/29
*/
package Polynomial;
public class LinkedListItr {
LinkedListItr(ListNode theNode)
{ current=theNode;
www.eeworm.com/read/207835/15260639
java josephus.java
/*用循环链表求解约瑟夫(josephus)问题
例，n=8, m=3（报数）从1号开始报数出列顺序为：3, 6, 1, 5, 2,
8, 4。最后一个编号7的旅客将赢得环球旅游。*/
import java.io.*;
public class Josephus{
public LinkedList list;
public void initial(int
www.eeworm.com/read/207835/15260644
java linkedlist.java
public class LinkedList{
public ListNode header;
public LinkedList(){
header=new ListNode(null);
}
public boolean isEmpty()
{return header.next==null;}
public void makeEmpty()
{header
www.eeworm.com/read/207835/15260646
java linkedlistitr.java
public class LinkedListItr
{ LinkedListItr( ListNode theNode)
{ current = theNode;
}
public boolean isPastEnd( )
{ return current == null;
}
public Obje
www.eeworm.com/read/475291/6795765
java linkedlist.java
// Decompiled by Jad v1.5.7g. Copyright 2000 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/SiliconValley/Bridge/8617/jad.html
// Decompiler options: packimports(3)
// Source File Na
www.eeworm.com/read/473488/6844252
cpp 3.cpp
/*主控菜单处理测试程序*/
#include
#include
#include
typedef struct { //通讯录结点类型
char num[5]; //学号
char name[9]; //姓名
char sex[3]; //性别
float math; //数学
www.eeworm.com/read/473399/6852000
cpp shujv.cpp
/****************************************/
/*主控菜单处理测试程序main2.c************/
/***************************************/
#include "stdio.h"
#include "string.h"
#include "stdlib.h"
typedef struct {
www.eeworm.com/read/473403/6852025
cpp 123.cpp
#include
#include
typedef struct node
{
int data;
struct node *next;
} ListNode;
typedef ListNode *LinkList;
void main()
{
LinkList R;
int n,k;
LinkL