[C++] Challenge 10 (Unreviewed)

_bin/test

@@ -91,7 +91,10 @@ for input in $test_dir/t*; do
 
     diff user_result $test_dir/o$count > comparison
     if [[ -s comparison ]] ; then
+        echo "----------------------------"
         echo "Incorrect for $count th example.";
+        cat comparison
+        echo "----------------------------"
     else
         echo "Correct for $count th example.";
         let corr++

challenge_10/cpp/manuel/Makefile

@@ -0,0 +1,33 @@
+SRC := $(wildcard src/*.cpp)
+HEADERS := $(wildcard $(addprefix src/include/, *.h))
+
+OBJDIR := obj
+BINDIR := bin
+OBJECTS := $(addprefix $(OBJDIR)/, $(notdir src/ $(SRC:.cpp=.o)))
+
+EXE := solution.exe
+CC := g++ 
+CFLAGS := -Wall -c -std=c++11
+LFLAGS := -Wall
+
+$(EXE) : $(BINDIR) $(OBJDIR) $(OBJECTS)
+	@$(CC) $(LFLAGS) -o $(BINDIR)/$@ $(OBJECTS)
+
+obj/%.o : src/%.cpp $(HEADERS)
+	@$(CC) $(CFLAGS) -o $@ $<
+
+.PHONY : clean test $(BINDIR) $(OBJDIR)
+
+clean : 
+	@rm -rf $(BINDIR) $(OBJDIR)
+
+test:
+	@cd ../../../;\
+		./_bin/test 10 cpp manuel;\
+		cd challenge_10/cpp/manuel/;\
+
+$(BINDIR) : 
+	@mkdir -p $(BINDIR)
+
+$(OBJDIR) :
+	@mkdir -p $(OBJDIR)

challenge_10/cpp/manuel/README.md

@@ -0,0 +1,29 @@
+# Valid Closers
+###### C++11 @manuel
+
+### 1. Approch to Solving the problem
+
+To solve this challenge I used a map to count the closers.
+
+If we had a left bracket we incremented the map to it by one.
+
+If we had a right bracket, we decremented the map to the corresponding
+left bracket by one.
+
+If at any point, the counter fell below 0, then there was a right
+bracket without a corresponding left bracket and the test was False;
+
+At the end of all the keys returna a value of 0, then all the brackets
+were closed.
+
+### 2. How to compile and run this code
+
+```
+make
+make test 
+make clean
+```
+
+### 3. How this program works
+
+Single line of input -> Single line of output

challenge_10/cpp/manuel/src/include/tools.h

@@ -0,0 +1,11 @@
+#ifndef TOOLS_H
+#define TOOLS_H
+
+namespace tools {
+
+    std::map<char, int> count(std::string);
+    bool verify_closers(std::map<char, int>);
+
+}
+
+#endif

challenge_10/cpp/manuel/src/main.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+#include <string>
+#include <map>
+
+#include "include/tools.h"
+
+int main(int argc, char **argv) {
+
+    std::string input;
+    std::getline(std::cin, input);
+
+    std::map<char, int> counter = tools::count(input);
+    if (tools::verify_closers(counter)) {
+        std::cout << "True" << std::endl;
+    } else {
+        std::cout << "False" << std::endl;
+    }
+
+    return 0;
+}

challenge_10/cpp/manuel/src/tools.cpp

@@ -0,0 +1,45 @@
+#include <map>
+#include <string>
+
+#include "include/tools.h"
+
+std::map<char, int> tools::count (std::string input) {
+
+    std::map<char, int> counter;
+    int length = input.length();
+
+    for(int i = 0; i < length; i++) {
+        if(input[i] == '(' || input[i] == '{' || input[i] == '[' || input[i] == '<') {
+            // count all the openers
+            counter[input[i]]++;
+
+            // count the closers
+        } else if(input[i] == ')') {
+            counter['(']--;
+        } else if(input[i] == '}') {
+            counter['{']--;
+        } else if(input[i] == ']') {
+            counter['[']--;
+        } else if(input[i] == '>') {
+            counter['<']--;
+        }
+
+        if(counter['('] < 0 || counter['{'] < 0 || counter['['] < 0 || counter['<'] < 0) {
+            // Right side closer without a pair
+
+            counter.clear();
+            return counter;
+        }
+    }
+
+    return counter;
+}
+
+bool tools::verify_closers(std::map<char, int> counter) {
+
+    if(counter.empty() || counter ['<'] != 0 || counter['{'] != 0 || counter['('] != 0 || counter['['] != 0 ) {
+        return false;
+    }
+
+    return true;
+}