登录
首页 » Java » Leetcode-master

Leetcode-master

于 2020-06-20 发布
0 389
下载积分: 1 下载次数: 1
我要下载

代码说明：

说明：  力扣网面试题答案，源码，供大家参考参考，祝大家面试顺利(The answer to the interview questions on the Internet, source code, for your reference, I wish you a smooth interview.)

文件列表：

Leetcode-master, 0 , 2019-07-21
Leetcode-master\README.md, 98049 , 2019-07-21
Leetcode-master\src, 0 , 2019-07-21
Leetcode-master\src\0001-Two-Sum, 0 , 2019-07-21
Leetcode-master\src\0001-Two-Sum\two_sum.c, 1944 , 2019-07-21
Leetcode-master\src\0001-Two-Sum\two_sum.cpp, 728 , 2019-07-21
Leetcode-master\src\0001-Two-Sum\two_sum.go, 347 , 2019-07-21
Leetcode-master\src\0001-Two-Sum\two_sum.py, 532 , 2019-07-21
Leetcode-master\src\0001-Two-Sum\two_sum.rs, 0 , 2019-07-21
Leetcode-master\src\0002-Add-Two-Numbers, 0 , 2019-07-21
Leetcode-master\src\0002-Add-Two-Numbers\Add_Two_Numbers.cpp, 1685 , 2019-07-21
Leetcode-master\src\0002-Add-Two-Numbers\Add_Two_Numbers.go, 848 , 2019-07-21
Leetcode-master\src\0002-Add-Two-Numbers\Add_Two_Numbers.py, 961 , 2019-07-21
Leetcode-master\src\0003-Longest-Substring-Without-Repeating-Characters, 0 , 2019-07-21
Leetcode-master\src\0003-Longest-Substring-Without-Repeating-Characters\0003.cpp, 789 , 2019-07-21
Leetcode-master\src\0003-Longest-Substring-Without-Repeating-Characters\0003.go, 321 , 2019-07-21
Leetcode-master\src\0003-Longest-Substring-Without-Repeating-Characters\0003.py, 563 , 2019-07-21
Leetcode-master\src\0004-Median-of-Two-Sorted-Arrays, 0 , 2019-07-21
Leetcode-master\src\0004-Median-of-Two-Sorted-Arrays\0004.cpp, 1447 , 2019-07-21
Leetcode-master\src\0004-Median-of-Two-Sorted-Arrays\0004.py, 1254 , 2019-07-21
Leetcode-master\src\0005-Longest-Palindromic-Substring, 0 , 2019-07-21
Leetcode-master\src\0005-Longest-Palindromic-Substring\0005.cpp, 1038 , 2019-07-21
Leetcode-master\src\0005-Longest-Palindromic-Substring\0005.go, 856 , 2019-07-21
Leetcode-master\src\0005-Longest-Palindromic-Substring\0005.py, 708 , 2019-07-21
Leetcode-master\src\0006-ZigZag-Conversion, 0 , 2019-07-21
Leetcode-master\src\0006-ZigZag-Conversion\0006.cpp, 622 , 2019-07-21
Leetcode-master\src\0006-ZigZag-Conversion\0006.go, 425 , 2019-07-21
Leetcode-master\src\0006-ZigZag-Conversion\0006.py, 481 , 2019-07-21
Leetcode-master\src\0007-Reverse-Integer, 0 , 2019-07-21
Leetcode-master\src\0007-Reverse-Integer\0007.cpp, 529 , 2019-07-21
Leetcode-master\src\0007-Reverse-Integer\0007.go, 420 , 2019-07-21
Leetcode-master\src\0007-Reverse-Integer\0007.py, 353 , 2019-07-21
Leetcode-master\src\0008-String-to-Integer-(atoi), 0 , 2019-07-21
Leetcode-master\src\0008-String-to-Integer-(atoi)\0008.cpp, 597 , 2019-07-21
Leetcode-master\src\0008-String-to-Integer-(atoi)\0008.go, 662 , 2019-07-21
Leetcode-master\src\0008-String-to-Integer-(atoi)\0008.py, 540 , 2019-07-21
Leetcode-master\src\0009-Palindrome-Number, 0 , 2019-07-21
Leetcode-master\src\0009-Palindrome-Number\0009.cpp, 335 , 2019-07-21
Leetcode-master\src\0009-Palindrome-Number\0009.go, 259 , 2019-07-21
Leetcode-master\src\0009-Palindrome-Number\0009.py, 159 , 2019-07-21
Leetcode-master\src\0010-Regular-Expression-Matching, 0 , 2019-07-21
Leetcode-master\src\0010-Regular-Expression-Matching\0010.cpp, 1036 , 2019-07-21
Leetcode-master\src\0010-Regular-Expression-Matching\0010.go, 766 , 2019-07-21
Leetcode-master\src\0010-Regular-Expression-Matching\0010.py, 749 , 2019-07-21
Leetcode-master\src\0011-Container-With-Most-Water, 0 , 2019-07-21
Leetcode-master\src\0011-Container-With-Most-Water\0011.cpp, 635 , 2019-07-21
Leetcode-master\src\0011-Container-With-Most-Water\0011.go, 418 , 2019-07-21
Leetcode-master\src\0011-Container-With-Most-Water\0011.py, 493 , 2019-07-21
Leetcode-master\src\0012-Integer-to-Roman, 0 , 2019-07-21
Leetcode-master\src\0012-Integer-to-Roman\0012.cpp, 608 , 2019-07-21
Leetcode-master\src\0012-Integer-to-Roman\0012.go, 378 , 2019-07-21
Leetcode-master\src\0012-Integer-to-Roman\0012.py, 559 , 2019-07-21
Leetcode-master\src\0013-Roman-to-Integer, 0 , 2019-07-21
Leetcode-master\src\0013-Roman-to-Integer\0013.cpp, 572 , 2019-07-21
Leetcode-master\src\0013-Roman-to-Integer\0013.go, 352 , 2019-07-21
Leetcode-master\src\0013-Roman-to-Integer\0013.py, 406 , 2019-07-21
Leetcode-master\src\0014-Longest-Common-Prefix, 0 , 2019-07-21
Leetcode-master\src\0014-Longest-Common-Prefix\0014.cpp, 599 , 2019-07-21
Leetcode-master\src\0014-Longest-Common-Prefix\0014.go, 376 , 2019-07-21
Leetcode-master\src\0014-Longest-Common-Prefix\0014.py, 344 , 2019-07-21
Leetcode-master\src\0015-3Sum, 0 , 2019-07-21
Leetcode-master\src\0015-3Sum\0015.cpp, 2995 , 2019-07-21
Leetcode-master\src\0015-3Sum\0015.py, 915 , 2019-07-21
Leetcode-master\src\0016-3Sum-Closest, 0 , 2019-07-21
Leetcode-master\src\0016-3Sum-Closest\0016.cpp, 1351 , 2019-07-21
Leetcode-master\src\0016-3Sum-Closest\0016.py, 1062 , 2019-07-21
Leetcode-master\src\0017-Letter-Combinations-of-a-Phone-Number, 0 , 2019-07-21
Leetcode-master\src\0017-Letter-Combinations-of-a-Phone-Number\0017.cpp, 1040 , 2019-07-21
Leetcode-master\src\0017-Letter-Combinations-of-a-Phone-Number\0017.py, 1468 , 2019-07-21
Leetcode-master\src\0018-4Sum, 0 , 2019-07-21
Leetcode-master\src\0018-4Sum\0018.cpp, 1358 , 2019-07-21
Leetcode-master\src\0018-4Sum\0018.py, 1579 , 2019-07-21
Leetcode-master\src\0019-Remove-Nth-Node-From-End-of-List, 0 , 2019-07-21
Leetcode-master\src\0019-Remove-Nth-Node-From-End-of-List\0019.cpp, 838 , 2019-07-21
Leetcode-master\src\0019-Remove-Nth-Node-From-End-of-List\0019.py, 1012 , 2019-07-21
Leetcode-master\src\0020-Valid-Parentheses, 0 , 2019-07-21
Leetcode-master\src\0020-Valid-Parentheses\0020.cpp, 876 , 2019-07-21
Leetcode-master\src\0020-Valid-Parentheses\0020.py, 590 , 2019-07-21
Leetcode-master\src\0021-Merge-Two-Sorted-Lists, 0 , 2019-07-21
Leetcode-master\src\0021-Merge-Two-Sorted-Lists\0021.cpp, 1110 , 2019-07-21
Leetcode-master\src\0021-Merge-Two-Sorted-Lists\0021.py, 1267 , 2019-07-21
Leetcode-master\src\0022-Generate-Parentheses, 0 , 2019-07-21
Leetcode-master\src\0022-Generate-Parentheses\0022.cpp, 602 , 2019-07-21
Leetcode-master\src\0022-Generate-Parentheses\0022.py, 450 , 2019-07-21
Leetcode-master\src\0023-Merge-k-Sorted-Lists, 0 , 2019-07-21
Leetcode-master\src\0023-Merge-k-Sorted-Lists\0023.cpp, 1093 , 2019-07-21
Leetcode-master\src\0023-Merge-k-Sorted-Lists\0023.py, 1174 , 2019-07-21
Leetcode-master\src\0024-Swap-Nodes-in-Pairs, 0 , 2019-07-21
Leetcode-master\src\0024-Swap-Nodes-in-Pairs\0024.cpp, 873 , 2019-07-21
Leetcode-master\src\0024-Swap-Nodes-in-Pairs\0024.py, 1059 , 2019-07-21
Leetcode-master\src\0025-Reverse-Nodes-in-k-Group, 0 , 2019-07-21
Leetcode-master\src\0025-Reverse-Nodes-in-k-Group\0025.cpp, 1050 , 2019-07-21
Leetcode-master\src\0025-Reverse-Nodes-in-k-Group\0025.py, 1202 , 2019-07-21
Leetcode-master\src\0026-Remove-Duplicates-from-Sorted-Array, 0 , 2019-07-21
Leetcode-master\src\0026-Remove-Duplicates-from-Sorted-Array\0026.cpp, 670 , 2019-07-21
Leetcode-master\src\0026-Remove-Duplicates-from-Sorted-Array\0026.py, 488 , 2019-07-21
Leetcode-master\src\0027-Remove-Element, 0 , 2019-07-21
Leetcode-master\src\0027-Remove-Element\0027.cpp, 717 , 2019-07-21
Leetcode-master\src\0027-Remove-Element\0027.py, 506 , 2019-07-21
Leetcode-master\src\0028-Implement-strStr(), 0 , 2019-07-21

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • 1
    说明：  稳健自适应波束形成，Wiley出版社，是一本有关MVDR波束形成稳健性分析的好书。(The latest research and developments in robust adaptive beamforming Recent work has made great strides toward devising robust adaptive beamformers that vastly improve signal strength against background noise and directional interference. This dynamic technology has diverse applications, including radar, sonar, acoustics, astronomy, seismology, communications, and medical imaging. There are also exciting emerging applications such as smart antennas for wireless communications, handheld ultrasound imaging systems, and directional hearing aids. Robust Adaptive Beamforming compiles the theories and work of leading researchers investigating various approaches in one comprehensive volume. Unlike previous efforts, these pioneering studies are based on theories that use an uncertainty set of the array steering vector. The researchers define their theories, explain their methodologies, and present their conclusions. Methods presented include: Coupling the standard Capon beamformers with a spher)
    2009-07-21 16:49:18下载
    积分：1
  • Elastohydrodynamic_Lubrication
    本书为清华大学温诗铸院士的一本弹流润滑专著，很权威。(This book is an academician of EHL,written by Shi-Zhu Wen a monograph in Tsinghua University.it is authoritative.)
    2010-02-23 22:11:38下载
    积分：1
  • Learning to Program Using Python 2nd edition
    A little guide to python programming
    2019-02-26 15:58:25下载
    积分：1
  • MATLAB_Simulink-for-power-system
    A book named Matlab/Simulink for power system , writted by YuQun.
    2016-09-20 14:45:34下载
    积分：1
  • chaos
    吕金虎、陈关荣的混沌时间序列分析及其应用pdf版图书(吕金虎, Chen Guanrong Chaotic Time Series Analysis and Its Application pdf version of the book)
    2008-04-27 22:32:59下载
    积分：1
  • four-parameter-sine-wave
    论文四参数正弦波曲线拟合的快速算法，文中给出算法及算法实现程式(Papers four-parameter sine wave curve fitting of the fast algorithm, the text is given algorithm and algorithm programs)
    2009-12-10 15:19:01下载
    积分：1
  • Image3
    this book is image process.
    2009-05-25 18:40:58下载
    积分：1
  • WinCImage
    说明：  源码 for "C語言數位影像處理" 吳上力 編譯(Source code for "C language digital image processing")
    2009-07-24 11:10:54下载
    积分：1
  • Learning_CSharp_2005_2nd_Edition
    Learning C# 2005 By Jesse Liberty, Brian MacDonald ............................................... Publisher: O Reilly Pub Date: February 2006 Pages: 552 Programming C# and Programming ASP.NET, has written an entry-level guide to C#.
    2010-01-05 09:43:38下载
    积分：1
  • book
    VB书籍 推荐之作 力顶 有需要的速度下载(VB)
    2009-09-16 08:55:58下载
    积分：1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2026 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！