【文件属性】：
文件名称：leetcode答案-LeetCode:我的力扣解决方案
文件大小：8KB
文件格式：ZIP
更新时间：2021-06-30 00:59:40
系统开源
leetcode
答案
LeetCode
My
LeetCode
solution
List
4.
Longest
Substring
Without
Repeating
Characters：
Using
the
dict[]
to
record
the
last
position
of
each
letter.
5.
Longest
Palindromic
Substring:
Learning
"Manacher"
algorithm.
tips:substr(start_position,lens)
6.
ZigZag
Conversion:
Find
the
Regulation.
11.
Container
With
Most
Water
问题简述：给出一个list
a,找到一组i,j使得**min(a[i],a[j])*(j-i)**最大
思路：设置首位指针h,t
从较小的一段往中间移动，同时更新答案
12.
Integer
to
Roman
- >using
this
radix:
mod
=
['M','CM','D','CD','C','XC','L','XL'
【文件预览】：
LeetCode-master
----32. Longest Valid Parentheses.py(529B)
----13. Roman to Integer.py(501B)
----11. Container With Most Water.py(356B)
----temp25.py(568B)
----15. 3Sum(1003B)
----5. Longest Palindromic Substring(923B)
----14. Longest Common Prefix.py(380B)
----17. Letter Combinations of a Phone Number.py(1KB)
----16. 3Sum Closest.py(1KB)
----12. Integer to Roman.py(479B)
----README.md(3KB)
----18. 4Sum.py(953B)
----4.Longest Substring Without Repeating Characters.cpp(347B)
----6. ZigZag Conversion.py(424B)