哪位高手帮我这个菜鸟修改一下代码，不胜感激呀！

2025-01-14 02:32:07

推荐回答（2个）

回答1：

1楼司马，函数功能是错的。
经我全部改正，结果验证无误：
头文件：circlist.h
#include
using namespace std;

template
class circlist;

template
class Node
{
friend class circlist;
public:
Node(const Type &val = 0, Node *next = NULL):m_data(val),m_next(next)
{};
/*Node *NextNode() const
{
return m_next;
}*/
//private:
Type m_data;
Node *m_next;
};

template
class Circlist
{
public:
Circlist(const Type &value = 0)
{
m_head = NULL;
m_curr = m_head;
}
void Insert(const Type &value);
void Create(int n);
void Remove();
bool Isempty()
{
return m_head->m_next == m_head;
};
void Josephus(int n,int m);
private:
Node *m_head, *m_curr;
};

template
void Circlist:: Insert(const Type &value)
{
cirlistnode *newnode = new cirlistnode(value);
m_curr = m_head;
int i=1;
while(i < value)
{
m_curr = m_curr->m_next;
i++;
}
newnode->m_next = m_curr->m_next;
m_curr->m_next = newnode;
}

template
void Circlist::Create(int n)
{
int i;
Node *newNode;
for(i = 0; i < n; ++i)
{
newNode = new Node(i+1);
if(NULL == m_head)
{
m_head = newNode;
}
else
{
m_curr->m_next = newNode;
}
m_curr = newNode;
}
m_curr->m_next = m_head;
m_curr = m_head;
}

template
void Circlist::Remove()
{
Node *q;
q= m_curr->m_next;
m_curr->m_next = q->m_next;
delete q;
}

template
void Circlist::Josephus(int n, int m)
{
Create(n);
int i;
Node *pre;
while(m_curr->m_next != m_curr)
{
for(i=0;i {
pre = m_curr;
m_curr = m_curr->m_next;
}
pre->m_next = m_curr->m_next;
// cout << "delete: " << m_curr->m_data;
delete m_curr;
m_curr = pre->m_next;
}
cout<m_data;
}
执行文件：Josephus.cpp：

#include "circlist.h"

int _tmain(int argc, _TCHAR* argv[])
{
Circlist clist(1);
int n,m;
cout<<"输入2个数\n";
cin>>n>>m;
clist.Josephus(n,m);
return 0;
}

回答2：

输入2个数100 36
51请按任意键继续. . .

vs2008 大概人品好没办法

#pragma once

template
class circlist;
template
class cirlistnode
{
friend class circlist;
public:

cirlistnode(Type d):data(d){}
cirlistnode(Type d,cirlistnode *next1):data(d),link(next1)
{};
private:
Type data;
cirlistnode*link;
};

template
class circlist
{

public:
circlist(const Type &value)
{
first=last=new cirlistnode(value);
(*first).link=first;
}
void insert(const Type & value);
void remove();
void next();
bool isempty()
{
return first.link==first;
};
void josephus(Type n,Type m);
private:
cirlistnode *first,*current,*last;
};

template
void circlist:: insert(const Type& value)
{
cirlistnode * newnode=new cirlistnode(value);
cirlistnode *p=first;
int i=1;
while(i {
p=p->link;
i++;
}
newnode->link=p->link;
p->link=newnode;
}

template
void circlist::remove()
{
cirlistnode*q;
q=current->link;
current->link=q->link;
delete q;
}

template
void circlist::next()
{
current=current->link;
}
#include "circlist.h"
#include
using namespace std;

template
void circlist::josephus(Type n ,Type m)
{
current=first;
for(int i=0;i {
for(int j=0;j next();
remove();
}
cout<<(current->link)->data;
}
void main()
{
circlist clist(1);
int n,m;
cout<<"输入2个数";
cin>>n>>m;
for(int i=2;i<=n;i++)
clist.insert(i);
clist.josephus(n,m);
}

最新问答

请问每隔三个月拉直一次头发的频率会不会稍频繁？对头发对身体的伤害会不会较大？谢谢

减震橡胶动刚度的单位是什么?

影歌猎豹和刃拳的宽容⼀嗜血胸针哪个好？