【文件属性】：
文件名称：leetcode和oj-python_Oj:力码
文件大小：17KB
文件格式：ZIP
更新时间：2021-06-30 02:44:27
系统开源
leetcode
和
oj
Python_Leetcode_Oj
键盘行
line1
,
line2
,
line3
=
set
(
'qwertyuiop'
),
set
(
'asdfghjkl'
),
set
(
'zxcvbnm'
)
ret
=
[]
for
word
in
words
:
w
=
set
(
word
.
lower
())
if
w
.
issubset
(
line1
)
or
w
.
issubset
(
line2
)
or
w
.
issubset
(
line3
):
ret
.
append
(
word
)
反向词
'
'
.
join
(
map
(
lambda
x
:
x
[::
-
1
],
s
.
split
()))
下一个更大的元素
for
i
in
num2
:
while
len
(
temp
)
and
temp
[
-
1
]
<
i
:
cache
[
temp
.
pop
()]
=
i
temp
.
append
(
i
)
for
x
in
num1
:
if
x
in
cache
:
result
.
appe
【文件预览】：
python_Oj-master
----Amazon_copy_link.py(1KB)
----Unique_Email_Address.py(445B)
----.gitignore(22B)
----657RobotReturntoOrigin.py(139B)
----804morse_unique595bigcountry.py(2KB)
----keyboard_row.py(968B)
----next_greater.py(805B)
----461HammingDistance.py(134B)
----yield.py(661B)
----942DIStringMatch.py(560B)
----728SelfDividingNumbers.py(689B)
----700SearchBinaryTree.py(541B)
----852PeakIndexinMountainArray.py(977B)
----FindDiff.py(256B)
----Add_Digits.py(150B)
----561ArrayPartitionI.py(186B)
----FindMaxConsecutiveOnes.py(372B)
----IsUnivalTree.py(363B)
----Binary_array_sum.py(2KB)
----933NumberofRecentCalls.py(216B)
----Longgest_uncommon_substring.py(170B)
----Maxsubarray.py(471B)
----README.md(2KB)
----Jewels_Stones.py(293B)
----617MergeTwoBinaryTrees.py(783B)
----sort.py(2KB)
----reverse_words.py(189B)
----Find_anagram_mappings.py(198B)
----590N-aryTreePostOrder.py(374B)
----961repeatedNTimes.py(333B)
----Invert_Binary_Tree.py(945B)
----Find_Complete.py(338B)
----832FlippinganImage.py(704B)
----985SumofEvenNumbersAfterQueries.py(842B)
----944DeleteColumnstoMakeSorted.py(784B)
----922SortArrayByParityII.py(338B)
----905SortArrayByParity.py(381B)