#include
// 定义链表节点结构体 struct ListNode {
int data;
ListNode* next;
};
// 创建链表 ListNode* createList(int n) {
ListNode* head = new ListNode();
ListNode* cur = head;
for (int i = 0; i < n; i++) {
int num;
cin >> num;
ListNode* newNode = new ListNode();
newNode->data = num;
newNode->next = nullptr;
cur->next = newNode;
cur = cur->next;
}
return head;
}
// 打印链表 void printList(ListNode* head) {
if (head == nullptr || head->next == nullptr) {
return;
}
ListNode* cur = head->next;
while (cur != nullptr) {
cout << cur->data << " ";
cur = cur->next;
}
cout << endl;
}
// 移动元素位置 bool moveElement(ListNode* head, int currentPos, int targetPos) {
if (currentPos == targetPos || head == nullptr || head->next == nullptr) {
return false;
}
// 获取待移动的节点和其前一个节点
ListNode* prevNode1 = nullptr; // 待移动节点的前一个节点
ListNode* currentNode1 = head; // 待移动节点
while (currentNode1 != nullptr && currentPos > 0) {
prevNode1 = currentNode1;
currentNode1 = currentNode1->next;
currentPos--;
}
if (currentNode1 == nullptr) {
cout << "error" << endl;
return false;
}
ListNode* prevNode2 = nullptr; // 目标位置节点的前一个节点
ListNode* currentNode2 = head; // 目标位置节点
while (currentNode2 != nullptr && targetPos > 0) {
prevNode2 = currentNode2;
currentNode2 = currentNode2->next;
targetPos--;
}
if (currentNode2 == nullptr) {
cout << "error" << endl;
return false;
}
// 移动节点
if (prevNode1 != nullptr) {
prevNode1->next = currentNode1->next;
}
if (prevNode2 != nullptr) {
prevNode2->next = currentNode1;
} else {
head->next = currentNode1;
}
currentNode1->next = currentNode2;
return true;
}
int main() {
int n, t;
cin >> n;
ListNode* head = createList(n);
printList(head);
cin >> t;
for (int i = 0; i < t; i++) {
int currentPos, targetPos;
cin >> currentPos >> targetPos;
if(moveElement(head, currentPos, targetPos)){
printList(head);
}
}
return 0;
}
内容由零声教学AI助手提供，问题来源于学员提问
![/data # iw --debug dev wlan0 connect -w "lucky-5g" auth open key 0:1234567890
Usage: iw [options] dev connect [-w] [] [] [auth open|shared] [key 0:abcde d:1:6162636465] [mfp:req/opt/no]
Join the network with ...](https://linuxcpp.0voice.com/zb_users/upload/2023/05/202305162239148267954.png)
![驱动代码
void kalRxTaskletSchedule(struct GLUE_INFO *pr)
{
static unsigned int num = 0;
tasklet_hi_schedule(&pr->rRxTask[(num++)%NR_CPUS]);
// tasklet_hi_schedule(&pr->rRxTask);
DBGLOG(HAL, ERROR,](https://linuxcpp.0voice.com/zb_users/upload/2023/05/202305162226144313964.png)
