摘要：
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
阅读排行榜
[LeetCode] 876. Middle of the Linked List_Easy tag: Linked List
2019-05-02 10:12 by Johnson_强生仔仔, 323 阅读, 收藏,
摘要：
Given a non-empty, singly linked list with head node head, return a middle node of linked list. If there are two middle nodes, return the second middl 阅读全文
[LeetCode] 261. Graph Valid Tree _ Medium tag: BFS
2018-07-06 04:30 by Johnson_强生仔仔, 322 阅读, 收藏,
摘要：
Given n nodes labeled from 0 to n-1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make 阅读全文
[LeetCode] 系统刷题3_排列组合/backtracking
2019-04-11 10:23 by Johnson_强生仔仔, 320 阅读, 收藏,
摘要：
适用范围： 几乎所有搜索问题 什么时候输出 哪些情况需要跳过 Python library import itertools itertools.product('ABC', repeat = 2) 3 * 3 = 9 list(itertools.product('ABC', repeat = 2 阅读全文
[LeetCode] 131. Palindrome Partitioning_Medium tag: DFS, backtracking, Palindrome
2019-05-25 10:14 by Johnson_强生仔仔, 313 阅读, 收藏,
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example: 这 阅读全文
浙公网安备 33010602011771号