Lint cleanup from Jim Roseborough

Change-Id: Ic55b8e48110bc651ae942d34fe5402a6e0422fe3

docs/source/building.rst

diff --git a/docs/source/building.rst b/docs/source/building.rst
index 8b9cf11..ca56eb9 100644
--- a/docs/source/building.rst
+++ b/docs/source/building.rst
@@ -295,8 +295,8 @@
 
 .. NOTE::
 
-  If you find the following `CMake` difficult to setup, then you maybe
-  interested in a `Microsoft Visual Studio wrapper
+  If you find the following `CMake` difficult to set up, then you may
+  be interested in a `Microsoft Visual Studio wrapper
   <https://www.zemax.com/about-us>`_ for Ceres Solver by Tal Ben-Nun.
 
 On Windows, we support building with Visual Studio 2010 or newer. Note

docs/source/version_history.rst

diff --git a/docs/source/version_history.rst b/docs/source/version_history.rst
index 2d9a3fe..c6d9cfd 100644
--- a/docs/source/version_history.rst
+++ b/docs/source/version_history.rst
@@ -49,11 +49,11 @@
 #. Added ``Problem::GetCostFunctionForResidualBlock`` and
    ``Problem::GetLossFunctionForResidualBlock``.
 #. Added Tukey's loss function. (Michael Vitus)
-#. Add RotationMatrixToQuaternion
+#. Added RotationMatrixToQuaternion
 #. Compute & report timing information for line searches.
 #. Autodetect gflags namespace.
 #. Expanded ``more_garbow_hillstrom.cc``.
-#. Add a pointer to Tal Ben-Nun's MSVC wrapper to the docs.
+#. Added a pointer to Tal Ben-Nun's MSVC wrapper to the docs.
 
 Backward Incompatible API Changes
 ---------------------------------

examples/more_garbow_hillstrom.cc

diff --git a/examples/more_garbow_hillstrom.cc b/examples/more_garbow_hillstrom.cc
index f064488..3a8e312 100644
--- a/examples/more_garbow_hillstrom.cc
+++ b/examples/more_garbow_hillstrom.cc
@@ -557,7 +557,7 @@
   std::stringstream ss;
 
 #define UNCONSTRAINED_SOLVE(n)                                          \
-  ss << "Unconstrained Problem" << n << " : ";                          \
+  ss << "Unconstrained Problem " << n << " : ";                          \
   if (FLAGS_problem == #n || FLAGS_problem == "all") {                  \
     unconstrained_problems += 3;                                        \
     if (Solve<ceres::examples::TestProblem##n>(false, 0)) {             \