algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

[mypy] fix small folders (#4292)

Browse Source 
* add final else-statement

* fix file_transfer

* fix quantum folder

* fix divide_and_conquer-folder

* Update build.yml

* updating DIRECTORY.md

* Update ripple_adder_classic.py

* Update .github/workflows/build.yml

* removed imports from typing

* removed conversion to string

* Revert "removed conversion to string"

This reverts commit 2f7c4731d1.

* implemented suggested changes

* Update receive_file.py

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
algobytewise
2021-03-23 21:21:50 +05:30
committed by GitHub
parent a8db5d4b93
commit 959507901a
8 changed files with 15 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
divide_and_conquer/max_difference_pair.py
View File

@@ -1,7 +1,4 @@
from typing import List
def max_difference(a: List[int]) -> (int, int):
def max_difference(a: list[int]) -> tuple[int, int]:
"""
We are given an array A[1..n] of integers, n >= 1. We want to
find a pair of indices (i, j) such that