$///============$ PART $1$: FIXED code $==========///$

$///======$ DON'T CHANGE THIS PART $============///$

#include

#include

#define MAX$\_$WORD$\_$CHAR $100$

#define GPA "GPA"

#define DATE "DATE"

struct Date

$\{$

int year;

int month;

int day;

$\}$;

typedef struct Date Date;

struct Node

$\{$

Date dob;

float gpa;

struct Node $*$next;

$\}$;

typedef struct Node Node;

void readData$($FILE $*,$ char $**,$ float $*,$ Node $**,$ Node $**)$;

Node $*$mergeList$($Node $*,$ Node $*)$;

Node $*$filterList$($Node $*,$ char $*,$ float$)$;

Node $*$reverseList$($Node $*)$;

void printList$($Node $*)$;

int main$()$

$\{$

FILE $*$fp $=$ fopen$("$DATA$.$IN$","$r$")$;

Node $*$headL$1=$ NULL;

Node $*$headL$2=$ NULL;

char $*$controlString;

float targetGPA;

readData$($fp$,$ &controlString, &targetGPA, &headL$1,$ &headL$2)$;

printList$($headL$1)$;

printf$("$

$")$;

printList$($headL$2)$;

printf$("$

$")$;

Node $*$head $=$ mergeList$($headL$1,$ headL$2)$;

head $=$ filterList$($head$,$ controlString, targetGPA$)$;

head $=$ reverseList$($head$)$;

printList$($head$)$;

fclose$($fp$)$;

$\}$

$///============$ PART $2$: Student works $==========///$

$//$ Define supported functions here.

int strLen$($char $*$word$)$

$\{$

int i $=0$;

while $(*($word $+$ i$)!=\text{'}\backslash 0\text{'})$

i$++$;

return i;

$\}$

Node $*$swap$($Node $*$ptr$1,$ Node $*$ptr$2)$

$\{$

Node $*$tmp $=$ ptr$2->$next;

ptr$2->$next $=$ ptr$1$;

ptr$1->$next $=$ tmp;

return ptr$2$;

$\}$

Node $*$readOneLine$($FILE$*$ fp$)$

$\{$

$//$ TODO: read data of student $($date of birth and GPA$)$ in 'one line'

$//$ The new node will be inserted at the end of list

$//$ return the head of this list.

Node $*$head $=$ NULL;

Node $*$pre $=$ NULL;

while $(1)$

$\{$

int month, day, year;

float gpa;

int res $=$ fscanf$($fp$,"\%*[^0-9]\%02$d$/\%02$d$/\%04$d$\%*[^0-9]\%$f$\%*[^$

$]",$ &month, &day, &year, &gpa$)$;

if $($res $==\text{'}$

$\text{'}||$ res $==$ EOF$)$ break;

Node $*$new$\_$node $=($Node $*)$malloc$($sizeof$($Node$))$;

new$\_$node$->$dob.year $=$ year;

new$\_$node$->$dob.month $=$ month;

new$\_$node$->$dob.day $=$ day;

new$\_$node$->$gpa $=$ gpa;

new$\_$node$->$next $=$ NULL;

if $($head $==$ NULL$)$

$\{$

head $=$ new$\_$node;

$\}$

else

$\{$

pre$->$next $=$ new$\_$node;

$\}$

pre $=$ new$\_$node;

$\}$

return head;

$\}$

void readData$($FILE $*$fp$,$ char $**$controlString$,$ float $*$targetGPA$,$ Node $**$headL$1,$ Node $**$headL$2)$

$\{$

$//$ TODO: read data with file pointer fp:

$//$ LINE$1$: controlString targetGPA

$//($LT or GT$)($float number$)$

$//$ LINE$2$: headL$1$ is the head of list

$//$ LINE$3$: headL$2$ is the head of list

$*$controlString $=$ malloc$(10)$;

$//$ Read controlString and targetGPA from the first line of the file

fscanf$($fp$,"\%$s $\%$f$",*$controlString$,$ targetGPA$)$;

fgetc$($fp$)$;

$*$headL$1=$ readOneLine$($fp$)$;

$*$headL$2=$ readOneLine$($fp$)$;

$\}$

Node $*$mergeList$($Node $*$headL$1,$ Node $*$headL$2)$

$\{$

$//$ TODO: add list $2$ into the end of list $1,$ return the head of result list

if $($headL$1==$ NULL$)$ return headL$2$;

Node$*$ cur $=$ headL$1$;

while $($cur$->$next $!=$ NULL$)\{$

cur $=$ cur$->$next;

$\}$

cur$->$next $=$ headL$2$;

return headL$1$;

$\}$

Node $*$filterList$($Node $*$head$,$ char $*$controlString$,$ float targetGPA$)$

$\{$

$/*$

TODO: Filter the third list based on GPA criteria.

If controlString is $"$LT$",$ filter the students with a GPA less than targetGPA.

If controlString is $"$GT$",$ filter the students with a GPA greater than targetGPA.

return head of filtered list

$*/$

Node$*$ cur $=$ head;

Node$*$ pre $=$ NULL;

while $($cur $!=$ NULL$)\{$

if $(($controlString$[0]==\text{'}$G$\text{'}$ && cur$->$gpa $<=$ targetGPA$)||($controlString$[0]==\text{'}$L$\text{'}$ && cur$->$gpa $>=$ targetGPA$))\{$

if $($pre $==$ NULL$)\{$

head $=$ cur$->$next;

$\}$

else $\{$

pre$->$next $=$ cur$->$next;

$\}$

Node $*$temp $=$ cur;

cur $=$ cur$->$next;

free$($temp$)$;

$\}$

else $\{$

pre $=$ cur;

cur $=$ cur$->$next;

$\}$

$\}$

return head;

$\}$

Node $*$reverseList$($Node $*$head$)$

$\{$

$//$ TODO: reverse the list

$//$ return the new head

Node $*$pre $=$ NULL;

Node $*$cur $=$ head;

Node $*$next $=$ NULL;

while $($cur $!=$ NULL$)\{$

next $=$ cur$->$next;

cur$->$next $=$ pre;

pre $=$ cur;

cur $=$ next;

$\}$

return pre;

$\}$

void printList$($Node $*$head$)$

$\{$

$//$ TODO: print the linked list to stdout

Node $*$cur $=$ head;

while $($cur $!=$ NULL$)$

$\{$

if $($cur $!=$ head$)$

$\{$

printf$("\%02$d$/\%02$d$/\%04$d$,\%1\mathrm{.}2$f$",$ cur$->$dob.month, cur$->$dob.day, cur$->$dob.year, cur$->$gpa$)$;

$\}$

else

$\{$

printf$("\%02$d$/\%02$d$/\%04$d$,\%1\mathrm{.}2$f$",$ cur$->$dob.month, cur$->$dob.day, cur$->$dob.year, cur$->$gpa$)$;

$\}$

cur $=$ cur$->$next;

$\}$

$\}$

SAMPLE INPUT $1$

GT $3\mathrm{.}00$

abcd$11/11/2014$kkdsd$-3\mathrm{.}47$aa $03/11/2000-$dfgr$4\mathrm{.}00$g

$07/15/2001$a$-2\mathrm{.}48$fd xe$01/07/2004$kdl$-$dw$4\mathrm{.}00$

SAMPLE OUTPUT $1$

$11/11/2014,3\mathrm{.}4703/11/2000,4\mathrm{.}00$

$07/15/2001,2\mathrm{.}4801/07/2004,4\mathrm{.}00$

$01/07/2004,4\mathrm{.}0003/11/2000,4\mathrm{.}0011/11/2014,3\mathrm{.}47$

I didn't get the same output, can you fix my code?