Count the rectangles in an ASCII diagram like the one below.

   +--+
  ++  |
+-++--+
|  |  |
+--+--+

The above diagram contains 6 rectangles:

+-----+
|     |
+-----+

   +--+
   |  |
   |  |
   |  |
   +--+

   +--+
   |  |
   +--+

       
       
   +--+
   |  |
   +--+

       
       
+--+
|  |
+--+

       
  ++   
  ++   
       
       

You may assume that the input is always a proper rectangle (i.e. the length of every line equals the length of the first line).

To run the tests:

$ gradle test

For more detailed info about the Java track see the help page.

It's possible to submit an incomplete solution so you can see how others have completed the exercise.