Fix lgtm error display TheAlgorithms#1024 (TheAlgorithms#1190)

* fix: Syntax Error lgtm display in matrix/matrix_operation.py.

* Testing for None should use the 'is' operator.

* fix: Too many arguments for string format.

* fix: supress lgtm alert as false positive.

* style: Unnecessary 'pass' statement.

* Revert "fix: Syntax Error lgtm display in matrix/matrix_operation.py."

This reverts commit 4c629b4.

Author: denis-trofimov

data_structures/heap/binomial_heap.py

@@ -307,7 +307,7 @@ def deleteMin(self):
         # No right subtree corner case
         # The structure of the tree implies that this should be the bottom root
         # and there is at least one other root
-        if self.min_node.right == None:
+        if self.min_node.right is None:
             # Update size
             self.size -= 1
 

divide_and_conquer/convex_hull.py

@@ -191,7 +191,7 @@ def _validate_input(points):
             else:
                 raise ValueError("Expecting an iterable of type Point, list or tuple. "
                                  "Found objects of type {} instead"
-                                 .format(["point", "list", "tuple"], type(points[0])))
+                                 .format(type(points[0])))
         elif not hasattr(points, "__iter__"):
             raise ValueError("Expecting an iterable object "
                              "but got an non-iterable type {}".format(points))

neural_network/convolution_neural_network.py

@@ -297,7 +297,6 @@ def convolution(self, data):
 
 
 if __name__ == '__main__':
-    pass
     '''
     I will put the example on other file
-'''
+    '''

strings/boyer_moore_search.py

@@ -70,7 +70,7 @@ def bad_character_heuristic(self):
                 positions.append(i)
             else:
                 match_index = self.match_in_pattern(self.text[mismatch_index])
-                i = mismatch_index - match_index   #shifting index
+                i = mismatch_index - match_index   #shifting index lgtm [py/multiple-definition]
         return positions