链家笔试算法题

#include<iostream>
#include<stdio.h>
#include<memory.h>

using namespace std;

void exchange(int a[], int n)
{
int low = 0, high = n-1;
while(low < high)
{
while(low < high && a[low] % 2 == 1) low++;
while(low < high && a[high] % 2 == 0) high--;
swap(a[low],a[high]);
}
}

#include<iostream>
#include<stdio.h>
#include<memory.h>

using namespace std;

struct LinkList
{
int val;
LinkList * next;
LinkList(int v):val(v) {}
};

void removeDup(LinkList * head)
{
LinkList *pre, * cur;
if(head == nullptr) return ;
pre = head; cur = pre->next;
while(cur)
{
if(cur->val == pre->val)
{
cur = cur->next;
pre->next = cur;
}
else
{
pre = cur;
cur = cur->next;
}
}
}
//测试
int main()
{
int a[] = {1,1,2,3,3,4};
LinkList *head = nullptr, *p = nullptr;
for(int i = 0; i < 6; i++)
{
if(head == nullptr)
{
head = p= new LinkList(a[i]);
p->next = nullptr;
}
else
{
p->next = new LinkList(a[i]);
p = p->next;
p->next = nullptr;
}
}
p = head;
while(p)
{
cout<<p->val<<" ";
p = p->next;
}
cout<<endl;
removeDup(head);
p = head;
while(p)
{
cout<<p->val<<" ";
p = p->next;
}

return 0;
}