C++修改文件后缀名；链表循环删除乘积为10的元素

#include <iostream>
#include <io.h>
#include <fstream>
#include <string>
#include <vector>
using namespace std;// Input： 目录名称
// Output：文件列表清单class Findupdate {
public:void replaceFileNameList();//遍历文件列表替换文件名bool checkFile(string path);//查找路径下所有文件，不存在子文件夹bool checkFile_circ(string path, vector<string>& m_vec_file_path_name);//查找路径下所有文件，存在子文件夹~Findupdate(){m_vec_file_path_name.clear();}vector<string> m_vec_file_path_name; //文件名路径列表
private:bool replaceFileName(string oldFileName, string newFileName);//替换文件名 string m_modif_before = ".stp";             //指定修改前的字段
};bool Findupdate::replaceFileName(string oldFileName, string newFileName)
{fstream fs;fs.open(oldFileName.c_str());if (fs.fail()){cout << "文件打开失败！" << endl;fs.close();return false;}else{fs.close();if (rename(oldFileName.c_str(), newFileName.c_str()) == -1)   //文件重命名{cout << "文件名修改失败！" << endl;return false;}return true;}return true;
}void Findupdate::replaceFileNameList()
{int num = 1;string ModifyAfterFilds = "";                  //指定修改后的字段for (auto name : m_vec_file_path_name){//临时文件名用于字符替换string newFileName = name;int findIndex = name.find(m_modif_before, 1);if (findIndex != -1 && findIndex == (name.size()-4)){ModifyAfterFilds = ".stp-0" + std::to_string(num); num++;newFileName = newFileName.replace(findIndex, m_modif_before.size(), ModifyAfterFilds);cout << name << endl;cout << newFileName << endl;}else{continue;}        int ret = replaceFileName(name, newFileName);}
}bool Findupdate::checkFile(string path)
{string EachPath = path;      //临时路径，用于字符拼接intptr_t FileHandle;             //文件句柄struct _finddata_t FileInfo;     //文件信息if ((FileHandle = _findfirst(EachPath.append("\\*").c_str(), &FileInfo)) == -1){cout << "未找到文件! " << endl;return false;}else{while (_findnext(FileHandle, &FileInfo) == 0){if (strcmp(FileInfo.name, ".") != 0 && strcmp(FileInfo.name, "..") != 0){m_vec_file_path_name.push_back(FileInfo.name);cout << "FileName : " << FileInfo.name << endl;}}_findclose(FileHandle);}return true;
}bool Findupdate::checkFile_circ(string path, vector<string>& m_vec_file_path_name)
{string EachPath = path;      //临时路径，用于字符拼接intptr_t FileHandle;             //文件句柄struct _finddata_t FileInfo;     //文件信息//使用_findfirst查找文件，获取文件信息if ((FileHandle = _findfirst(EachPath.append("\\*").c_str(), &FileInfo)) == -1){cout << "failed find file! " << endl;return false;}else{do{   // 比较文件类型是否是文件夹if ((FileInfo.attrib &  _A_SUBDIR)){if (strcmp(FileInfo.name, ".") != 0 && strcmp(FileInfo.name, "..") != 0){EachPath = path;   //每次从根路径拼接//递归调用checkFile_circ(EachPath.append("\\").append(FileInfo.name), m_vec_file_path_name);}}else{EachPath = path;m_vec_file_path_name.push_back(EachPath.append("\\").append(FileInfo.name));cout << "PATH/FileName : " << EachPath << endl;}} while (_findnext(FileHandle, &FileInfo) == 0);_findclose(FileHandle);}return true;
}int main()
{string Path = "E:\\xx\\xx";      //自定义路径Findupdate f_upate;//  f_upate.checkFile(Path); //路径下没有子文件夹f_upate.checkFile_circ(Path, f_upate.m_vec_file_path_name);f_upate.replaceFileNameList();system("pause");return 0;
}

#include<iostream>
using namespace std;struct ListNode {  int val;  ListNode *next;  ListNode(int x) : val(x), next(NULL) {}  
};  class Solution
{
public:// 辅助函数：打印链表  void printList(ListNode* head) {  while (head) {  std::cout << head->val << " ";  head = head->next;  }  std::cout << std::endl;  }  // 辅助函数：创建链表  ListNode* createList(int arr[], int n) {  if (n == 0) return nullptr;  ListNode* head = new ListNode(arr[0]);  ListNode* curr = head;  for (int i = 1; i < n; ++i) {  curr->next = new ListNode(arr[i]);  curr = curr->next;  }  return head;  }  // 辅助函数：释放链表内存  void deleteList(ListNode* head) {  while (head) {  ListNode* temp = head;  head = head->next;  delete temp;  }  }  ListNode* removeSublists(ListNode* head){// 创建一个哑节点作为头节点的前驱  ListNode dummy(0);  dummy.next = head;  ListNode* prev = &dummy;  ListNode* curr = head;  while (curr && curr->next) {  // 检查当前节点和下一个节点的乘积是否为10  while (curr && curr->next && curr->val * curr->next->val == 10) {  // 删除这两个节点  prev->next = curr->next->next;  // 移动到下一个要检查的节点（注意这里不是curr = prev->next，因为prev->next可能已经被改变了）  curr = curr->next;}  curr = prev->next;  // 如果没有找到乘积为10的节点对，则移动到下一个要检查的节点对  if (curr) {  prev = curr;  curr = curr->next;  }  }  // 返回哑节点的下一个节点作为新的头节点  return dummy.next; }
};int main() {  int arr[] = {1, 2, 5, 2, 1, 2, 5}; // 示例链表：1 -> 2 -> 5 -> 2 -> 1 -> 2 -> 5  Solution sol_list;ListNode* head = sol_list.createList(arr, sizeof(arr) / sizeof(arr[0]));std::cout << "Original List: ";  sol_list.printList(head);head = sol_list.removeSublists(head);  std::cout << "List after removing product-ten nodes: ";  sol_list.printList(head);  sol_list.deleteList(head); // 释放链表内存  return 0;  
}