Optimize and_gate and nand_gate (#10591)

SandeepaDilshanAlagiyawanna · pre-commit-ci[bot] · web-flow · commit 5f629b60499c · 2023-10-17T01:17:49.000+02:00
* Added more optimized sudoku solver algorithm * Added more optimized sudoku solver algorithm and File Renamed * and_gate is Optimized * and_gate is Optimized * and_gate is Optimized * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
diff --git a/boolean_algebra/and_gate.py b/boolean_algebra/and_gate.py
@@ -29,7 +29,7 @@ def and_gate(input_1: int, input_2: int) -> int:
     >>> and_gate(1, 1)
     1
     """
-    return int((input_1, input_2).count(0) == 0)
+    return int(input_1 and input_2)
 
 
 if __name__ == "__main__":
diff --git a/boolean_algebra/nand_gate.py b/boolean_algebra/nand_gate.py
@@ -27,7 +27,7 @@ def nand_gate(input_1: int, input_2: int) -> int:
     >>> nand_gate(1, 1)
     0
     """
-    return int((input_1, input_2).count(0) != 0)
+    return int(not (input_1 and input_2))
 
 
 if __name__ == "__main__":

Original file line number	Diff line number	Diff line change
`@@ -29,7 +29,7 @@ def and_gate(input_1: int, input_2: int) -> int:`
`29`	`29`	`>>> and_gate(1, 1)`
`30`	`30`	`1`
`31`	`31`	`"""`
`32`		`- return int((input_1, input_2).count(0) == 0)`
	`32`	`+ return int(input_1 and input_2)`
`33`	`33`
`34`	`34`
`35`	`35`	`if __name__ == "__main__":`
Original file line number	Diff line number	Diff line change
`@@ -27,7 +27,7 @@ def nand_gate(input_1: int, input_2: int) -> int:`
`27`	`27`	`>>> nand_gate(1, 1)`
`28`	`28`	`0`
`29`	`29`	`"""`
`30`		`- return int((input_1, input_2).count(0) != 0)`
	`30`	`+ return int(not (input_1 and input_2))`
`31`	`31`
`32`	`32`
`33`	`33`	`if __name__ == "__main__":`