1 Star 0 Fork 0

lonuslan / daily-leetcode

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
贡献代码
同步代码
取消
提示: 由于 Git 不支持空文件夾,创建文件夹后会生成空的 .keep 文件
Loading...
README

daily-leetcode

  • daily leetcode problem pratice
注:
一般方法的第一种解法为最容易想到的解法

方法 +(functionName_approach_number)为该问题的优化解或最优解

eg:
Generally speaking, the first solution of the method is the easiest one to think of

Method plus (functionName_approach_number) is a better optimal or the best optimal solution for the problem

project menu :


    |-- src
    |   |-- main
    |   |   |-- java
    |   |   |   |-- com
    |   |   |       |-- lonuslan
    |   |   |           |-- dailyleetcode
    |   |   |               |-- chapter1
    |   |   |               |   |-- AddTwoNumbers.java
    |   |   |               |   |-- LongestSubstringWithoutRepeatingCharacters.java
    |   |   |               |   |-- MedianOfTwoSortedArrays.java
    |   |   |               |   |-- TwoSum.java
    |   |   |               |-- chapter2
    |   |   |               |   |-- ContainerWithMostWater.java
    |   |   |               |   |-- IntegerToRoman.java
    |   |   |               |   |-- LongestPalindromicSubstring.java
    |   |   |               |   |-- PalindromeNumber.java
    |   |   |               |   |-- RegularExpressionMatching.java
    |   |   |               |   |-- ReverseInteger.java
    |   |   |               |   |-- StringToIntegerAtoi.java
    |   |   |               |   |-- ZigzagConversion.java
    |   |   |               |   |-- chapter2easy
    |   |   |               |   |   |-- LongestCommonPrefix.java
    |   |   |               |   |   |-- RomanToInteger.java
    |   |   |               |   |   |-- ValidParentheses.java
    |   |   |               |   |-- chapter2hard
    |   |   |               |   |-- chapter2medium
    |   |   |               |       |-- LetterCombinationsOfAPhoneNumber.java
    |   |   |               |-- chapter3
    |   |   |               |   |-- class1.java
    |   |   |               |   |-- chapter3easy
    |   |   |               |   |   |-- ImplementStrstr.java
    |   |   |               |   |-- chapter3hard
    |   |   |               |   |-- chapter3medium
    |   |   |               |       |-- DivideTwoIntegers.java
    |   |   |               |-- entity
    |   |   |               |   |-- ListNode.java
    |   |   |               |   |-- Result.java
    |   |   |               |-- template
    |   |   |               |   |-- TemplateProblemDescription.java
    |   |   |               |-- utils
    |   |   |-- resources
    |   |       |-- properties.yml
    |   |-- test
    |       |-- java
    |           |-- com
    |               |-- lonuslan
    |                   |-- dailyleetcode
    |                       |-- chapter1
    |                       |   |-- AddTNTest.java
    |                       |   |-- LongestSubWithoutRepCharTest.java
    |                       |   |-- MedianOfTwoSortedArraysTest.java
    |                       |   |-- TwoSumTest.java
    |                       |-- chapter2
    |                       |   |-- ContainerWithMostWaterTest.java
    |                       |   |-- IntegerToRomanTest.java
    |                       |   |-- LongestPalindromicSunstringTest.java
    |                       |   |-- PalindromeNumberTest.java
    |                       |   |-- RegularExpressionMatchingTest.java
    |                       |   |-- ReverseIntegerTest.java
    |                       |   |-- StringToIntegerAtoiTest.java
    |                       |   |-- ZigzagConversionTest.java
    |                       |   |-- chapter2easy
    |                       |   |   |-- LongestCommonPrefixTest.java
    |                       |   |   |-- RomanToIntegerTest.java
    |                       |   |   |-- ValidParenthesesTest.java
    |                       |   |-- chapter2medium
    |                       |       |-- LetterCombinationsOfAPhoneNumberTest.java
    |                       |-- chapter3
    |                           |-- chapter3easy
    |                           |   |-- ImplementStrstrTest.java
    |                           |-- chapter3medium
    |                               |-- DivideTwoIntegersTest.java

unfinished

may the god bless u

Chapter_number : stand for the number of month;

eg : chapter1 stands for the January

change

I'm going to change my strategy from easy to hard

date: 2020-2-5 14 : 32

So I'm going to change my directory structure.

The package easy stands for the easy problems.

and so on;

空文件

简介

每日leetcode题目一练(...) 展开 收起
Java
取消

发行版

暂无发行版

贡献者

全部

近期动态

加载更多
不能加载更多了
Java
1
https://gitee.com/lonuslan/daily-leetcode.git
git@gitee.com:lonuslan/daily-leetcode.git
lonuslan
daily-leetcode
daily-leetcode
master

搜索帮助