数据结构冲刺练习题

#include <iostream>
using namespace std;

const int N = 1e5+10;

int a[N];

int main()
{
    
    int n;
    cin >> n;
    
    for(int i = 0;i < n;i++)cin >> a[i];
    
    int i = -1,j = n;
    while(i < j)
    {
        do i++;while(a[i] < 0);
        do j--;while(a[j] > 0);
        if(i<j)
        swap(a[i],a[j]);
    }
    
    
    for(int i = 0;i < n;i++)
    {
        if(i) cout <<" ";
        cout << a[i];
    }
    
    
    return 0;
}

#include <iostream>
using namespace std;
#include <vector>
struct Node{
	int data;
	Node*next;
};

int main()
{
	int n, m;
	cin >> n >> m;
	vector<int>res;
	Node * first = new Node;
	Node *pre = new Node;
	Node * p = new Node;

	pre = first;
	pre->next = p;
	p = first;
	if (n)
	{
		pre