![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Python学习
abc8350712
这个作者很懒,什么都没留下…
展开
-
Python正则表达式
import re s = 'Hello from csev@umich.edu to cwen@iupui.edu about the meeting @2PM' lst = re.findall('\S+@\S+', s) print lst要注意,\S+是指有至少一个的非空字符。 上面的输出结果是['csev@umich.edu', 'cwen@i转载 2016-10-15 22:16:35 · 202 阅读 · 0 评论 -
Word Ladder
以下是Leetcode discussion上别人的Python代码class Solution: def ladderLength(self, beginWord, endWord, wordDict): #front back初始化 front, back=set([beginWord]), set([endWord]) length=2翻译 2016-11-09 11:10:39 · 169 阅读 · 0 评论 -
豆瓣电影爬虫初探
import requests import re r=requests.get('https://movie.douban.com/top250?start=0&filter=') text=r.text #print text pattern=re.compile('<span class="title">(.*?)</span>.*?<span.*?average">(.*?)</span>.原创 2017-01-22 18:54:44 · 316 阅读 · 0 评论 -
Python爬虫讲座初探
import requests cookies={} raw_cookies='ASP.NET_SessionId=nhuk5l55y0dbxj2p4ud032ui;safedog-flow-item=27238BB48846C959582F6E52555A6CCA' for line in raw_cookies.split(';'): key,value=line.split('='原创 2017-01-24 20:58:42 · 626 阅读 · 0 评论 -
Word Break II
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. You may assume the diction原创 2017-01-30 13:39:26 · 443 阅读 · 0 评论 -
Word Ladder
这题主要是换个思路会简单很多。不用BFS而用DFSclass Solution(object): def ladderLength(self, beginWord, endWord, wordList): wordList.add(endWord) queue = collections.deque([[beginWord, 1]]) whil原创 2017-08-07 09:31:14 · 190 阅读 · 0 评论