Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Optimize and_gate and nand_gate #10591

Merged
merged 6 commits into from
Oct 16, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion boolean_algebra/and_gate.py
Original file line number Diff line number Diff line change
Expand Up @@ -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__":
Expand Down
2 changes: 1 addition & 1 deletion boolean_algebra/nand_gate.py
Original file line number Diff line number Diff line change
Expand Up @@ -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__":
Expand Down