代码搜索：2
找到约 10,000 项符合「2」的源代码
代码结果 10,000
www.eeworm.com/read/455289/7374800
opt chapter2_2.opt
www.eeworm.com/read/455289/7374803
dsw chapter2_2.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/455289/7374808
exe chapter2_2.exe
www.eeworm.com/read/455040/7378467
uv2 ex_2.uv2
### uVision2 Project, (C) Keil Software
### Do not modify !
Target (Target 1), 0x0000 // Tools: 'MCS-51'
Group (Source Group 1)
File 1,1, 0x0
Options 1,0,0 // Target
www.eeworm.com/read/454932/7381527
cpp main2-2.cpp
// main2-2.cpp 检验bo2-2.cpp的主程序(与main2-1.cpp很像)
#include"c1.h"
typedef int ElemType;
#include"c2-2.h" // 与main2-1.cpp不同
#include"bo2-2.cpp" // 与main2-1.cpp不同
Status comp(ElemType c1,ElemTy
www.eeworm.com/read/454932/7381532
cpp algo2-2.cpp
// algo2-2.cpp 实现算法2.2的程序
#include"c1.h"
typedef int ElemType;
#include"c2-1.h"
#include"bo2-1.cpp"
void MergeList(SqList La,SqList Lb,SqList &Lc) // 算法2.2
{ // 已知线性表La和Lb中的数据元素按值非递减排列。
www.eeworm.com/read/454932/7381553
cpp bo2-2.cpp
// bo2-2.cpp 单链表线性表(存储结构由c2-2.h定义)的基本操作(12个)
Status InitList(LinkList &L)
{ // 操作结果：构造一个空的线性表L
L=(LinkList)malloc(sizeof(LNode)); // 产生头结点,并使L指向此头结点
if(!L) // 存储分配失败
exit(OVERFLOW);
www.eeworm.com/read/454932/7381564
h c2-2.h
// c2-2.h 线性表的单链表存储结构
struct LNode
{
ElemType data;
LNode *next;
};
typedef LNode *LinkList; // 另一种定义LinkList的方法
www.eeworm.com/read/454660/7385927
java ex2(2).java
// exceptions/Ex2.java
// TIJ4 Chapter Exceptions, Exercise 2, page 452
/* Define an object reference and initialize it to null. Try to call a method
* through this reference. Now wrap the code in