代码搜索结果
找到约 10,000 项符合
T 的代码
t3.txt
void BinAdd(LinkList l)
/*单链表实现二进制数加1运算*/
{
Node *q,*r,*temp,*s;
q=l->next;
r=l;
while(q!=NULL) /*查找最后一个值域为0的结点*/
{
if(q->data == 0)
r = q;
q = q->next;
}
if(r != l)
t1.txt
void AdjustSqlist(SeqList *L)
{
int i=0,j=L->last;
int temp;
while(ielem[i]%2 != 0)
i++; /*从表的左半部分开始检测，若为奇数，则i加1,直到找到偶数为止*/
while(L->elem[j]%2 == 0)
j--;
t1.txt
Link *S<mark>t</mark>rIndex(LKS<mark>t</mark>ring *s, LKS<mark>t</mark>ring *<mark>t</mark>)
/*求子串<mark>t</mark>在主串s中第一次出现的位置指针*/
{
Link *sp,*<mark>t</mark>p,*pre;
if (<mark>t</mark>->len == 0)
re<mark>t</mark>urn NULL;/*子串是空串，则返回*/
sp = s->head->nex<mark>t</mark>;/*主串第一个结点指针*/
<mark>t</mark>p = <mark>t</mark>->head->nex<mark>t</mark>;/ ...
t3.txt
void printword(HashTable ht)
/*按第一个字母的顺序输出哈希表ht中的关键字，处理冲突的方法为线性探测开放定址法*/
{
int i,j;
for(i=1; i
t2.txt
void path(BiTree root, BiTNode *r)
{
BiTNode *p, *q;
int i, find=0, top=0;
BiTNode *s[NUM];
q = NULL; /* 用q保存刚遍历过的结点 */
p = root;
while ( (p != NULL || top != 0) && !find )
{
whi
t1.txt
int like(BiTree b1, BiTree b2)
{
int like1, like2;
if (b1==NULL && b2==NULL)
return (1);
else
if (b1==NULL || b2==NULL)
return (0);
else
{
like1=like(b1->LChild,
t9.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
t9.plg
Build Log
--------------------Configuration: t9 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\jason\LOCA
t9.dsp
# Microsoft Developer Studio Project File - Name="t9" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Consol