while循环
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<iomanip>
#include<cmath>
#include<bitset>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
typedef long long LL;
typedef long double ld;
#define INF (1ll<<60)-1
#define Maxn 1e9 + 100
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
void Del_x(ListNode *&L, int x) {
ListNode *now = L, *last;
while(now != NULL){
if(now->val % x == 0) {
last = now;
now = now->next;
} else {
cout <<"Delete: " << now->val <<endl;
ListNode *p = now;
now = now->next;
last->next = now;
delete p;
}
}
}
int main() {
ListNode *head, *node, *_end;
head = (ListNode *)malloc(sizeof(ListNode));
head->val = 0;
_end = head;
for (int i = 1; i < 10; i++) {
node = (ListNode *)malloc(sizeof(ListNode));
node->val = i;
_end->next = node;
_end = node;
}
_end->next = NULL;
Del_x(head, 2);
cout<< "now: ";
while(head != NULL){
cout << head->val << " ";
head = head->next;
}
cout << endl;
return 0;
}
递归
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct ListNode{
int val;
ListNode *next;
};
void Del_x(ListNode *&L, int x){
if(L == NULL) return;
ListNode *p = L;
if(p->val != x){
Del_x(L->next, x);
} else{
cout <<"Delete: " << p->val <<endl;
L = L->next;
delete p;
Del_x(L, x);
}
}
int main(){
ListNode *head, *node, *_end;
head = (ListNode *)malloc(sizeof(ListNode));
head->val = 0;
_end = head;
for (int i = 1; i < 10; i++){
node = (ListNode *)malloc(sizeof(ListNode));
node->val = i;
_end->next = node;
_end = node;
}
_end->next = NULL;
Del_x(head, 4);
cout<< "now: ";
while(head != NULL){
cout << head->val << " ";
head = head->next;
}
cout << endl;
return 0;
}