fluffy/adventOfCode2024
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

started working on detecting if the front or back number is the problem.

Browse source
This commit is contained in:
Seth Samuel 2024-12-03 12:19:45 +13:00
parent 08c10aecd5
commit 55f05e4f16
1 changed files with 26 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

30
2/puzzle2p2.cpp
View file

@ -10,7 +10,8 @@ using namespace std;
enum Direction { enum Direction {
UP, UP,
DOWN DOWN,
UNSET
}; };
int main(){ int main(){
@ -32,9 +33,13 @@ int main(){
int numOfLevelsInLine = currentLevels.size(); int numOfLevelsInLine = currentLevels.size();
int numOfLevelsProcessed = 0; int numOfLevelsProcessed = 0;
auto curListIt = currentLevels.begin(); auto curListIt = currentLevels.begin();
curListIt++; //point to second item in list curListIt++; //point to second item in list
auto RevCurListIt = currentLevels.rbegin();
RevCurListIt++; //points to second to last item
enum Direction dir; enum Direction dir;
bool dirSet =false; bool dirSet =false;
bool listDirty =false;
//check first number, second number and last number to see if they all acend or deced //check first number, second number and last number to see if they all acend or deced
//if not check second number, third number and last number to see if they accend or decend //if not check second number, third number and last number to see if they accend or decend
@ -48,13 +53,28 @@ int main(){
dir= UP; dir= UP;
dirSet=true; dirSet=true;
} }
//first item bad //check ends first.
if(!dirSet){ if(!dirSet){
int secondItem = (*curListIt); int secondItem = (*curListIt);
curListIt++; //points to thirdlist item curListIt++; //points to thirdlist item from front
int secondToLastItem = (*RevCurListIt);
RevCurListIt++;//points to 3rd to last item
if((secondItem>(*curListIt)&&(secondItem>currentLevels.back()))){ if((secondItem>(*curListIt)&&(secondItem>currentLevels.back()))){
currentLevels.pop_front()//remove first item dir=DOWN;
dirSet=true;
currentLevels.pop_front();//remove first item
listDirty=true;
} else if((secondItem<(*curListIt)&&(secondItem<currentLevels.back()))){
dir = UP;
dirSet= true;
currentLevels.pop_front();
listDirty=true;
} else if ((currentLevels.front()>currentLevels.back()&&(currentLevels.front()>secondToLastItem))){
dir = DOWN;
dirSet= true;
} }
//check if the back item is the problem
} }
//need to pull the first one to have something to compare to //need to pull the first one to have something to compare to