mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 21:41:08 +00:00
5f629b6049
* 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>
37 lines
952 B
Python
37 lines
952 B
Python
"""
|
|
A NAND Gate is a logic gate in boolean algebra which results to 0 (False) if both
|
|
the inputs are 1, and 1 (True) otherwise. It's similar to adding
|
|
a NOT gate along with an AND gate.
|
|
Following is the truth table of a NAND Gate:
|
|
------------------------------
|
|
| Input 1 | Input 2 | Output |
|
|
------------------------------
|
|
| 0 | 0 | 1 |
|
|
| 0 | 1 | 1 |
|
|
| 1 | 0 | 1 |
|
|
| 1 | 1 | 0 |
|
|
------------------------------
|
|
Refer - https://www.geeksforgeeks.org/logic-gates-in-python/
|
|
"""
|
|
|
|
|
|
def nand_gate(input_1: int, input_2: int) -> int:
|
|
"""
|
|
Calculate NAND of the input values
|
|
>>> nand_gate(0, 0)
|
|
1
|
|
>>> nand_gate(0, 1)
|
|
1
|
|
>>> nand_gate(1, 0)
|
|
1
|
|
>>> nand_gate(1, 1)
|
|
0
|
|
"""
|
|
return int(not (input_1 and input_2))
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|