profile
viewpoint

showuon/kafka 1

Mirror of Apache Kafka

showuon/books-recommendation 0

程序员进阶、面试书籍(视频),持续更新(Programmer Books)

showuon/codimd 0

CodiMD - Realtime collaborative markdown notes on all platforms.

showuon/docs 0

Prometheus documentation: content and static site generator

showuon/grunt-contrib-jasmine 0

Run jasmine specs headlessly through Headless Chrome

showuon/hibernate-hhh13760 0

Reproducing code for HHH13760 (JDK11)

showuon/hibernate-orm 0

Hibernate's core Object/Relational Mapping functionality

showuon/jenkins 0

Jenkins automation server

push eventanzhihe/learning

anzhihe

commit sha 2ebae139dbc23de9ebd8cf25597947f6d1a0bb0c

Update README.md

view details

push time in 4 hours

push eventZhongFuCheng3y/3y

Java3y

commit sha 28545cc2cbae14be87bb3dd9264cc53bccca9a7e

Update README.md

view details

push time in 21 hours

push eventZhongFuCheng3y/3y

Java3y

commit sha a1517ffcb2ac4d0782953c5517168be8e9a969f1

Update README.md

view details

push time in 3 days

push eventZhongFuCheng3y/3y

三歪

commit sha 3e9237670f9fa38bed1c207533ad3a1a7074f455

1122

view details

push time in 3 days

push eventMikoto10032/DeepLearning

mikoto10032

commit sha c00eee4738d322f6eb5d61d5bafbcfa7b20152a0

add Softmax理解系列

view details

push time in 4 days

push eventanzhihe/learning

anzhihe

commit sha 1cd7f5ccc072c880b55afbbcc22f28dc11cb89f9

add 计算机网络 自顶向下方法(第七版) 中文版.pdf

view details

push time in 8 days

push eventMikoto10032/DeepLearning

mikoto10032

commit sha 61ff0b11d215cfafa3d15a270bfef7a6cda84671

CTR深度交叉特征入门总结

view details

push time in 8 days

push eventanzhihe/learning

anzhihe

commit sha 247c0370df2644a1c134d51d4592c424b7d3b776

Update README.md

view details

push time in 11 days

push eventanzhihe/learning

anzhihe

commit sha bfd12b0ed828b0ee4ef3bfc2bc98dfe125ef3a74

add 图解网络-v2.0.pdf

view details

push time in 11 days

issue openedchanggyhub/leetcode_101

感谢作者!

感谢作者!非常赞的题解!不知道作者有没有Python Version的计划?

created time in 13 days

fork chia7712/phoenix-omid

Mirror of Apache Omid Incubator

fork in 14 days

fork chia7712/samza

Mirror of Apache Samza

fork in 14 days

fork chia7712/phoenix

Mirror of Apache Phoenix

fork in 14 days

push eventchanggyhub/leetcode_101

Chang Gao

commit sha 9b27c3c08f64ec6c199281adb012b0bdbca32be4

Update README.md

view details

push time in 19 days

fork stanislavkozlovski/cp-ansible

Ansible playbooks for the Confluent Platform

fork in 19 days

push eventibmresilient/resilient-scripts

Bastian Graebener

commit sha 041e547a89bd1c1a5d104b1150df8a32fe282ada

add query_builder example script

view details

push time in 21 days

pull request commentazl397985856/leetcode

feat(ml): $2.add-two-numbers.md

好的------------------ 原始邮件 ------------------ 发件人: "lucifer"<notifications@github.com> 发送时间: 2020年10月29日(星期四) 中午12:03 收件人: "azl397985856/leetcode"<leetcode@noreply.github.com>; 抄送: "Zong"<1003160664@qq.com>;"Author"<author@noreply.github.com>; 主题: Re: [azl397985856/leetcode] Update 2.add-two-numbers.md (#452)

ztianming

comment created time in a month

push eventazl397985856/leetcode

Zong

commit sha 5a01b3a95e73e346b3b01f67b3edd0bf43205033

feat(ml): $78.subsets.md (#451) Co-authored-by: lucifer <azl397985856@gmail.com>

view details

push time in a month

PR merged azl397985856/leetcode

feat(ml): $78.subsets.md

添加Java、python语言支持

+52 -1

0 comment

1 changed file

ztianming

pr closed time in a month

push eventazl397985856/leetcode

Zong

commit sha a99a728aac7519ae4e1aec43786e8fdff5d66406

feat(ml): $2.add-two-numbers.md (#452) Co-authored-by: lucifer <azl397985856@gmail.com>

view details

push time in a month

PR merged azl397985856/leetcode

feat(ml): $2.add-two-numbers.md

添加Java、python语言支持

+80 -4

0 comment

1 changed file

ztianming

pr closed time in a month

push eventazl397985856/leetcode

Zong

commit sha 4362873eb9043d15698502cac4728db15294e735

feat(ml): $3.longest-substring-without-repeating-characters.md (#453) Co-authored-by: lucifer <azl397985856@gmail.com>

view details

push time in a month

PR merged azl397985856/leetcode

feat(ml): $3.longest-substring-without-repeating-characters.md

添加C++、Java语言支持

+60 -2

0 comment

1 changed file

ztianming

pr closed time in a month

pull request commentazl397985856/leetcode

Update 17.Letter-Combinations-of-a-Phone-Number.md

python会一点基本使用,大佬 可以之后再上笛卡尔积,实现多方法题解 ------------------ 原始邮件 ------------------ 发件人: "lucifer"<notifications@github.com>; 发送时间: 2020年10月29日(星期四) 中午11:41 收件人: "azl397985856/leetcode"<leetcode@noreply.github.com>; 抄送: "天明"<1003160664@qq.com>; "Author"<author@noreply.github.com>; 主题: Re: [azl397985856/leetcode] Update 17.Letter-Combinations-of-a-Phone-Number.md (#454) @azl397985856 commented on this pull request. 你还精通了 Python 厉害。 不过这道题, 我不想用回溯了, 我想用笛卡尔积去做。 — You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub, or unsubscribe.

你看我上面的代码解法怎么样

ztianming

comment created time in a month

pull request commentazl397985856/leetcode

Update 17.Letter-Combinations-of-a-Phone-Number.md

python会一点基本使用,大佬 可以之后再上笛卡尔积,实现多方法题解

------------------ 原始邮件 ------------------ 发件人: "lucifer"<notifications@github.com>; 发送时间: 2020年10月29日(星期四) 中午11:41 收件人: "azl397985856/leetcode"<leetcode@noreply.github.com>; 抄送: "天明"<1003160664@qq.com>; "Author"<author@noreply.github.com>; 主题: Re: [azl397985856/leetcode] Update 17.Letter-Combinations-of-a-Phone-Number.md (#454)

@azl397985856 commented on this pull request.

你还精通了 Python 厉害。

不过这道题, 我不想用回溯了, 我想用笛卡尔积去做。

— You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub, or unsubscribe.

ztianming

comment created time in a month

pull request commentazl397985856/leetcode

Update 17.Letter-Combinations-of-a-Phone-Number.md


# 输入:"23"
# 输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
class Solution:
    def letterCombinations(self, digits: str) -> List[str]:
        mapper = [" ", " ", "abc", "def", "ghi",
                  "jkl", "mno", "pqrs", "tuv", "wxyz"]

        def backtrack(digits, start):
            if start >= len(digits):
                return ['']
            ans = []
            for i in range(start, len(digits)):
                for c in mapper[int(digits[i])]:
                    for p in backtrack(digits, i + 1):
                        if start == 0:
                            if len(c + p) == len(digits):
                                ans.append(c + p)
                        else:
                            ans.append(c + p)
            return ans
        if not digits:
            return []
        return backtrack(digits, 0)
   
ztianming

comment created time in a month

PR opened azl397985856/leetcode

Update 17.Letter-Combinations-of-a-Phone-Number.md

添加C++、Java、Python语言支持

+115 -1

0 comment

1 changed file

pr created time in a month

push eventazl397985856/leetcode

lucifer

commit sha 2d63322a1e1ba9e16fd05f5c5948f72e80b326ba

feat: 修复 book.json

view details

push time in a month

PR opened azl397985856/leetcode

Update 3.longest-substring-without-repeating-characters.md

添加C++、Java语言支持

+59 -1

0 comment

1 changed file

pr created time in a month

PR opened azl397985856/leetcode

Update 2.add-two-numbers.md

添加Java、python语言支持

+80 -4

0 comment

1 changed file

pr created time in a month

more