Backport trivial changes

examples/java/FlowExample.java

@@ -19,7 +19,6 @@ import com.google.ortools.graph.MinCostFlow;
 
 /**
  * Sample showing how to model using the flow solver.
- *
  */
 public class FlowExample {
   private static void solveMinCostFlow() {

examples/java/LinearAssignmentAPI.java

@@ -20,7 +20,6 @@ import com.google.ortools.graph.LinearSumAssignment;
  * Test assignment on a 4x4 matrix. Example taken from
  *  http://www.ee.oulu.fi/~mpa/matreng/eem1_2-1.htm with kCost[0][1]
  *  modified so the optimum solution is unique.
- *
  */
 public class LinearAssignmentAPI {
   private static void runAssignmentOn4x4Matrix() {

examples/java/LinearProgramming.java

@@ -21,7 +21,6 @@ import com.google.ortools.linearsolver.MPVariable;
 
 /**
  * Linear programming example that shows how to use the API.
- *
  */
 public class LinearProgramming {
   private static void runLinearProgrammingExample(String solverType, boolean printModel) {

examples/java/RabbitsPheasants.java

@@ -22,15 +22,13 @@ import java.util.logging.Logger;
 
 /**
  * Sample showing how to model using the constraint programming solver.
- *
  */
 public class RabbitsPheasants {
   private static Logger logger = Logger.getLogger(RabbitsPheasants.class.getName());
 
   /**
-   * Solves the rabbits + pheasants problem.  We are seing 20 heads
-   * and 56 legs. How many rabbits and how many pheasants are we thus
-   * seeing?
+   * Solves the rabbits + pheasants problem. We are seeing 20 heads and 56 legs. How many rabbits
+   * and how many pheasants are we thus seeing?
    */
   private static void solve(boolean traceSearch) {
     ConstraintSolverParameters parameters =