python爬取Leetcode所有未ac题目

事情起源于寒假刚开始的时候
立下假期要好好学习的flag
决定继续刷leetcode 然而在不知道从什么时候开始刷leetcode到现在
居然从三百多题增长到了四百多题 感觉自己刷题速度都要跟不上增长了
按以前的列表刷难免漏题 决定写个”爬虫”

GitTips记录自己踩的坑

在踩了无数坑后爬过来～记录自己的学习tips～
也是资源收集站
包括但不仅限于 git hexo md

Django搭建MyOne过程记录

接触django也有一段时间，因为期末考试忙也没有写博客～
这几天打算把自己写的练手项目重头梳理一遍部署到云端～
就把过程记录下来啦
使用django1.10 python2.7

Django学习Tips *部分踩坑总结

在踩了无数坑后爬过来～记录自己的学习tips～
使用django1.10 python2.7

LeetCode p434 Number of Segments in a String 题解

1.题目：

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.

Please note that the string does not contain any non-printable characters.

Example:

Input: “Hello, my name is John”
Output: 5

LeetCode p437 Path Sum III 题解

1.题目：

You are given a binary tree in which each node contains an integer value.

Find the number of paths that sum to a given value.

The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).

The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.

Example:

root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8

  10
 /  \
5   -3

/ \ \
3 2 11
/ \ \
3 -2 1

Return 3. The paths that sum to 8 are:

1. 5 -> 3
2. 5 -> 2 -> 1
3. -3 -> 11

LeetCode p459 Repeated Substring Pattern 题解

1.题目：

Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English letters only and its length will not exceed 10000.

Example 1:

Input: “abab”

Output: True

Explanation: It’s the substring “ab” twice.

Example 2:

Input: “aba”

Output: False

Example 3:

Input: “abcabcabcabc”

Output: True

Explanation: It’s the substring “abc” four times. (And the substring “abcabc” twice.)