update

Author: Carlos Leonard

60_ClosestEnemy.cpp

@@ -0,0 +1,78 @@
+// For this challenge you will search in an array for an enemy.
+/*
+have the function ClosestEnemy(arr) take the array of numbers stored in arr and from the position in the array where a 1 is, return the number of spaces either left or right you must move to reach an enemy which is represented by a 2. For example: if arr is [0, 0, 1, 0, 0, 2, 0, 2] then your program should return 3 because the closest enemy (2) is 3 spaces away from the 1. The array will contain any number of 0's and 2's, but only a single 1. It may not contain any 2's at all as well, where in that case your program should return a 0.
+*/
+
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+
+/*
+Locate the one index
+iterate to the left and search for any enemies
+If found keep track of its distance
+iterate to the right and search for any enemies and keep distance
+report the closest enemy
+if none found return 0
+*/
+
+int ClosestEnemy(int arr[], int size) 
+{
+	int enemy = size * 100;
+
+	// Locate the index of our position
+	int start = distance(arr,find(arr, size+arr, 1));
+
+	// Locating the enemy to the left
+	// We increment the length to use as a boundary check
+	// If is equal to that boundary check length than we know the value was not found
+	int left = distance(arr, find(arr, (start + arr)+1, 2));
+	
+	// Loop condition in the case we have multiples enemies before the start location
+	// We have to increase our index from the start each time to ensure we reach the closest enemy
+	int temp = left;
+	int index = 0;
+	while (temp != start + 1)
+	{
+		left = temp;
+		temp = distance(arr, find(arr+index, (start + arr) + 1, 2));
+		index++;
+	}
+
+	// Condition to check if found
+	// If found find the difference in distance
+	if (left != start+1)
+	{
+		enemy = start - left;
+	}
+
+	// Locating the closest enemy to the right
+	int right = distance(arr, find(start + arr, (size + arr)+1, 2));
+	if (right != size + 1 && right - start < enemy)
+	{
+		enemy = right - start;
+	}
+	
+	// Condition to check if any enemies where found
+	if (enemy == size * 100)
+	{
+		return 0;
+	}
+	else
+	{
+		return enemy;
+	}
+}
+
+int main() 
+{
+	int A[] = { 0, 0, 1, 0, 0, 2, 0, 2 };
+	int B[] = { 1, 0, 0, 0, 2, 2, 2 };
+	int C[] = { 2, 0, 0, 0, 2, 2, 1, 0 };
+	cout << ClosestEnemy(A, sizeof(A) / sizeof(A[0])) << endl; // 3
+	cout << ClosestEnemy(B, sizeof(B) / sizeof(B[0])) << endl; // 4
+	cout << ClosestEnemy(C, sizeof(C) / sizeof(C[0])) << endl; // 1
+	return 0;
+
+}

Debug/Fun Practice.log

@@ -1,10 +1,13 @@
-Build started 11/28/2016 1:41:01 PM.
+Build started 12/20/2016 12:12:23 PM.
      1>Project "C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Fun Practice\Fun Practice.vcxproj" on node 2 (Build target(s)).
-     1>Link:
-         C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\link.exe /ERRORREPORT:PROMPT /OUT:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.exe" /INCREMENTAL /NOLOGO kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /MANIFEST /MANIFESTUAC:"level='asInvoker' uiAccess='false'" /manifest:embed /DEBUG /PDB:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.pdb" /SUBSYSTEM:CONSOLE /TLBID:1 /DYNAMICBASE /NXCOMPAT /IMPLIB:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.lib" /MACHINE:X86 Debug\test.obj
+     1>ClCompile:
+         C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\CL.exe /c /ZI /nologo /W3 /WX- /sdl /Od /Oy- /D WIN32 /D _DEBUG /D _CONSOLE /D _LIB /D _UNICODE /D UNICODE /Gm /EHsc /RTC1 /MDd /GS /fp:precise /Zc:wchar_t /Zc:forScope /Fo"Debug\\" /Fd"Debug\vc120.pdb" /Gd /TP /analyze- /errorReport:prompt 60_ClosestEnemy.cpp
+         60_ClosestEnemy.cpp
+       Link:
+         C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\link.exe /ERRORREPORT:PROMPT /OUT:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.exe" /INCREMENTAL /NOLOGO kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /MANIFEST /MANIFESTUAC:"level='asInvoker' uiAccess='false'" /manifest:embed /DEBUG /PDB:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.pdb" /SUBSYSTEM:CONSOLE /TLBID:1 /DYNAMICBASE /NXCOMPAT /IMPLIB:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.lib" /MACHINE:X86 Debug\60_ClosestEnemy.obj
          Fun Practice.vcxproj -> C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.exe
      1>Done Building Project "C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Fun Practice\Fun Practice.vcxproj" (Build target(s)).
 
 Build succeeded.
 
-Time Elapsed 00:00:01.05
+Time Elapsed 00:00:00.89

Debug/Fun Practice.tlog/CL.read.1.tlog

@@ -11,7 +11,7 @@
     </ProjectConfiguration>
   </ItemGroup>
   <ItemGroup>
-    <ClCompile Include="59_VowelSquare.cpp" />
+    <ClCompile Include="60_ClosestEnemy.cpp" />
   </ItemGroup>
   <PropertyGroup Label="Globals">
     <ProjectGuid>{48DF0788-2D72-474C-9946-5512D2A5D092}</ProjectGuid>