I$\text{'}$m writing a call function in a C$++$ program and most of it is done. Its function is to complete battles between adjacent letters in a $2$D map matrix.

I hope that if the final health of the target letter is reduced to $0$ or less, the target letter will be replaced by the attacking letter, and the attacker's original position will be $"."$ Replacement.

If the final health of the target letter is greater than $0,$ both positions remain unchanged.

Please help me check the following call function and make it possible for it to fulfill the above requirements.

StatusFightAction updateMapAndHealthPointsForFightAction$($int healthPoints$[$MAX$\_$NUM$\_$WARRIORS$],$

$$char map$[$MAX$\_$ROWS$][$MAX$\_$COLS$],$

$$int mapRows, int mapCols,

$$const int fightPoints$[$MAX$\_$NUM$\_$WARRIORS$],$

$$char letter,

$$DirectionType direction,

$$char &targetLetter,

$$int &targetOriginalHealthPoint,

$$int &targetUpdatedHealthPoint$)$

$\{$

$$ int attackerIndex $=$ letter; $//$ Assuming letters map to indices like $\text{'}$A$\text{'}->0,\text{'}$B$\text{'}->1$

$$ int attackerFP $=$ fightPoints$[$attackerIndex$]$; $//$ Attacker's fight points

$//$ Step $1$: Find the position of the attacker $($letter$)$ in the map

$$ int attackerRow $=-1,$ attackerCol $=-1$;

$$ for $($int i $=0$; i $<$ mapRows; $++$i$)\{$

$$ for $($int j $=0$; j $<$ mapCols; $++$j$)\{$

$$ if $($map$[$i$][$j$]==$ letter$)\{$

$$ attackerRow $=$ i;

$$ attackerCol $=$ j;

$$ break;

$\}$

$\}$

$$ if $($attackerRow $!=-1)$ break; $//$ Exit once attacker is found

$\}$

$//$ If attacker not found in the map, return invalid status

$$ if $($attackerRow $==-1||$ attackerCol $==-1)\{$

$$ return STATUS$\_$ACTION$\_$FIGHT$\_$NOT$\_$IMPLEMENTED;

$\}$

$//$ Step $2$: Determine the target position based on the direction

$$ int targetRow $=$ attackerRow, targetCol $=$ attackerCol;

$$ switch $($direction$)\{$

$$ case DIRECTION$\_$NORTH: $$targetRow $=$ attackerRow $-1$; break;

$$ case DIRECTION$\_$SOUTH: $$targetRow $=$ attackerRow $+1$; break;

$$ case DIRECTION$\_$WEST: $$targetCol $=$ attackerCol $-1$; break;

$$ case DIRECTION$\_$EAST: targetCol $=$ attackerCol $+1$; break;

$\}$

$//$ Check if the target position is within the bounds of the map

$$ if $($targetRow $<0||$ targetRow $>=$ mapRows $||$ targetCol $<0||$ targetCol $>=$ mapCols$)\{$

$$ return STATUS$\_$ACTION$\_$FIGHT$\_$FAIL; $//$ Out of bounds

$\}$

$//$ Step $3$: Check if the target is a valid warrior $($must be a letter$)$

$$ char potentialTarget $=$ map$[$targetRow$][$targetCol$]$;

$$ if $($potentialTarget $==\text{'}.\text{'}||$ potentialTarget $<\text{'}$A$\text{'}||$ potentialTarget $>\text{'}$Z$\text{'})\{$

$$ return STATUS$\_$ACTION$\_$FIGHT$\_$FAIL; $//$ No valid target

$\}$

$//$ Step $4$: Update the health points of the target

$$ int targetIndex $=$ potentialTarget $-\text{'}$A$\text{'}$; $//$ Convert target letter to index

$$ targetLetter $=$ potentialTarget;

$$ targetOriginalHealthPoint $=$ healthPoints$[$targetIndex$]$;

$$ targetUpdatedHealthPoint $=$ targetOriginalHealthPoint $-$ attackerFP;

$//$ Update the health points array

$$ healthPoints$[$targetIndex$]=$ targetUpdatedHealthPoint;

$//$ Step $5$: Check if target's health reaches zero or below

$$ if $($targetUpdatedHealthPoint $<=0)\{$

$$ map$[$targetRow$][$targetCol$]=\text{'}.\text{'}$;

$$ targetUpdatedHealthPoint $=0$; $//$ Target defeated, update map

$$ return STATUS$\_$ACTION$\_$FIGHT$\_$SUCCESS;

$\}$

$$ return STATUS$\_$ACTION$\_$FIGHT$\_$SUCCESS;

$\}$