Python足迹
贫嘴小李子的幸福生活
这个作者很懒,什么都没留下…
展开
-
poplib获取邮件内容转化为Html格式
import poplibimport emailfrom email.parser import Parserfrom email.header import decode_headerfrom email.utils import parseaddrfrom bs4 import BeautifulSoupdef decode_str(s): return s ...原创 2018-03-30 10:08:14 · 1598 阅读 · 0 评论 -
Python3爬虫 处理分页
import loggingimport randomimport threadingimport urllib.parseimport urllib.parseimport urllib.requestfrom queue import Queueimport pymysqlfrom bs4 import BeautifulSoupimport timeclass Eba原创 2017-07-26 17:13:07 · 3571 阅读 · 0 评论 -
Python3 文件处理
import pandasimport xlwtclass MuFm: def __init__(self): self.fm = [] self.mu = [] class OutItems: def __init__(self , OfficeID , NetBookings , TotalADA , tdivn):原创 2017-07-28 13:11:59 · 379 阅读 · 0 评论 -
Python3 Cookie
import randomfrom http.cookiejar import CookieJarimport requestsfrom bs4 import BeautifulSoupclass EbaySpider(object): def __init__(self): self.SESSION = requests.session()原创 2017-07-31 17:10:08 · 299 阅读 · 0 评论 -
Python3 HashSet
import pandasimport xlwtclass People: def __init__(self , name , job_number): self.name = name self.job_number = job_number def __str__(self): return self.name + ",原创 2017-08-03 15:21:14 · 5878 阅读 · 0 评论 -
Django REST framework 截图教程
package com.ceair.utils;import java.io.IOException;import java.util.Map;import org.apache.commons.httpclient.HttpClient;import org.apache.commons.httpclient.HttpException;import org.apache.comm原创 2017-08-02 17:39:18 · 522 阅读 · 0 评论 -
ural 1106. Two Teams dfs
1106. Two TeamsTime limit: 1.0 secondMemory limit: 64 MBThe group of people consists of N members. Every member has one or more friends in the group. You are to write program that divide原创 2017-06-28 13:10:02 · 267 阅读 · 0 评论 -
ural 1119. Metro dp
1119. MetroTime limit: 0.5 secondMemory limit: 64 MBMany of SKB Kontur programmers like to get to work by Metro because the main office is situated quite close the station Uralmash. So,原创 2017-06-28 13:07:39 · 219 阅读 · 0 评论 -
leetcode-10Regular Expression Matching
题意:注意:这里的a*表示a可以重复0次或者多次,不是a和*分开的。It seems that some readers are confused about why the regex pattern ".*" matches the string"ab". ".*" means repeat the preceding element 0 or more tim原创 2015-06-24 17:52:08 · 304 阅读 · 0 评论 -
leetcode 7Reverse Integer 模拟
越界返回0。import java.util.* ;public class Solution{ public int reverse(int x){ int t = x < 0 ? -1 : 1 ; x = Math.abs(x) ; long s = 0 ; while(x > 0){原创 2015-06-24 09:17:51 · 290 阅读 · 0 评论 -
leetcode 6ZigZag Conversion模拟
暴力import java.util.* ;public class Solution{ public String convert(String s, int numRows) { if(s.length() == 0 || numRows == 1) return s ; String[] strrow = new String[numR原创 2015-06-23 21:39:05 · 335 阅读 · 0 评论 -
python3 多线程爬虫
import loggingimport randomimport threadingimport urllib.parseimport urllib.parseimport urllib.requestfrom queue import Queueimport pymysqlfrom bs4 import BeautifulSoupimport timeclass Ama原创 2017-07-26 13:50:09 · 451 阅读 · 0 评论 -
Python3 ural水题集锦
1025. Democracy in DangerTime limit: 1.0 secondMemory limit: 64 MBBackgroundIn one of the countries of Caribbean basin all decisions were accepted by the simple majority of votes at th原创 2017-06-22 09:50:13 · 345 阅读 · 0 评论 -
splinter
import timefrom splinter.browser import Browserif __name__ == '__main__': browser = Browser(driver_name="chrome") browser.visit("....login.do") browser.find_by_id("userCode").fill(".."原创 2018-01-03 15:28:46 · 257 阅读 · 0 评论 -
python opencv
import cv2import numpy as npimport mathimport sysimport osfrom pyocr import pyocrfrom PIL import Imageimport matplotlib.pyplot as pltimport matplotlibSTEP = int(0)def showWindow(img):原创 2017-12-07 09:50:19 · 441 阅读 · 0 评论 -
Python webservice
import pandasimport xlwtfrom suds.client import Clientimport loggingimport timedef getAirportCDsBychnName(airport_chn_name): api_url = 'http://.....MasterDataService?wsdl' # 这里是你的webservi原创 2017-11-30 10:01:57 · 416 阅读 · 0 评论 -
报表处理
import pandasimport xlwtclass MuFm: def __init__(self): self.fm = [] self.mu = [] class OutItems: def __init__(self , OfficeID , NetBookings , TotalADA , tdivn , O原创 2017-11-30 09:54:41 · 279 阅读 · 0 评论 -
python读写xls
import xlrdif __name__ == '__main__': # 打开一个workbook workbook = xlrd.open_workbook('C:\\Users\\liyang\\Desktop\\out.xls') # 抓取所有sheet页的名称 worksheets = workbook.sheet_names() prin原创 2017-06-15 13:31:47 · 345 阅读 · 0 评论 -
Python BeautifulSoup爬虫 HDU题目
import urllib.request as requestfrom bs4 import BeautifulSoupclass HduProblem(): def __init__(self,problem,problemDescription,problemInput,problemOutput,problemSampleInput,problemSampleOutput)原创 2017-06-16 10:14:31 · 361 阅读 · 0 评论 -
Python3 BeautifulSoup爬虫 POJ自动提交
import http.cookiejarimport loggingimport urllib.parseimport urllib.requestfrom bs4 import BeautifulSoupfrom submitcode import SubmitCodeclass SubmitPoj(): def __init__(self, userId, pas原创 2017-06-16 17:18:32 · 688 阅读 · 0 评论 -
Python3 BeautifulSoup爬虫 ZOJ自动提交
import http.cookiejarimport loggingimport timeimport urllib.parseimport urllib.requestfrom bs4 import BeautifulSoupfrom submitcode import SubmitCodeclass SubmitZoj(): def __init__(self,原创 2017-06-19 10:57:54 · 362 阅读 · 0 评论 -
Python3 BeautifulSoup爬虫 HDU自动提交
import http.cookiejarimport loggingimport timeimport urllib.parseimport urllib.requestfrom bs4 import BeautifulSoupfrom submitcode import SubmitCodeclass SubmitHDdu(): def __init__(self原创 2017-06-19 13:59:09 · 532 阅读 · 0 评论 -
Python3 BeautifulSoup pymysql
import http.cookiejarimport loggingimport timeimport urllib.parseimport urllib.requestimport pymysqlimport xlrdfrom bs4 import BeautifulSoupclass SalesSpider(): def __init__(self, userI原创 2017-06-21 08:31:57 · 303 阅读 · 0 评论 -
leetcode 5Longest Palindromic Substring 区间DP
区间dpimport java.util.* ;public class Solution{ public String longestPalindrome(String s){ int n = s.length() ; boolean[][] dp = new boolean[n][n] ; for原创 2015-06-23 21:13:16 · 339 阅读 · 0 评论 -
leetcode-4Median of Two Sorted Arrays 分治
寻找2个有序表的中位数,直接递归搞。import java.util.* ;public class Solution{ public double findMedianSortedArrays(int[] nums1, int[] nums2) { int n = nums1.length ; int m = nums2.length ;原创 2015-06-23 20:49:54 · 338 阅读 · 0 评论 -
ural 1297. Palindrome dp
1297. PalindromeTime limit: 1.0 secondMemory limit: 64 MBThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Un原创 2017-06-28 15:49:05 · 170 阅读 · 0 评论 -
leetcode 131. Palindrome Partitioning回文子串+DFS
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return[ ["aa","b"],原创 2017-05-22 17:33:50 · 251 阅读 · 0 评论 -
leetcode 200. Number of Islands DFS
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assu原创 2017-05-22 16:27:33 · 184 阅读 · 0 评论 -
lleetcode 307. Range Sum Query - Mutable树状数组
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.The update(i, val) function modifies nums by updating the element at index i to val.Examp原创 2017-05-22 16:00:11 · 467 阅读 · 0 评论 -
leetcode 208. Implement Trie (Prefix Tree)字典树
Implement a trie with insert, search, and startsWith methods.Note:You may assume that all inputs are consist of lowercase letters a-z.class Node(): def __init__(self): se原创 2017-05-22 13:13:30 · 204 阅读 · 0 评论 -
leetcode 240. Search a 2D Matrix II 模拟
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right.Integers in原创 2017-06-01 14:23:16 · 199 阅读 · 0 评论 -
leetcode 264. Ugly Number II DP
Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first原创 2017-06-01 10:47:51 · 237 阅读 · 0 评论 -
leetcode 202. Happy Number 模拟
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2017-06-01 09:44:13 · 168 阅读 · 0 评论 -
leetcode 64. Minimum Path Sum记忆化搜索
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at原创 2017-05-23 14:38:30 · 261 阅读 · 0 评论 -
leetcode 373. Find K Pairs with Smallest Sums 优先队列
You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.Define a pair (u,v) which consists of one element from the first array and one element from the second a原创 2017-05-23 13:36:21 · 229 阅读 · 0 评论 -
leetcode Add to List 34. Search for a Range 二分查找
Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the targ原创 2017-06-21 14:11:40 · 225 阅读 · 0 评论 -
ural 1022. Genealogical Tree 拓扑排序
1022. Genealogical TreeTime limit: 1.0 secondMemory limit: 64 MBBackgroundThe system of Martians’ blood relations is confusing enough. Actually, Martians bud when they want and where t原创 2017-06-22 14:07:17 · 188 阅读 · 0 评论 -
ural 1224. Spiral dfs
1224. SpiralTime limit: 1.0 secondMemory limit: 64 MBA brand new sapper robot is able to neutralize mines in a rectangular region having integer height and width (N and Mrespectively). B原创 2017-06-27 09:59:13 · 227 阅读 · 0 评论 -
ural 1880. Psych Up's Eigenvalues 贪心
有3个人每个人有n个特征值(1 ≤ n ≤ 4 000)求每个人都有的特征值有几个?(特征值 ≤ 10^9)Sampleinputoutput513 20 22 43 146413 22 43 146513 43 67 89 1463Problem Author: Deni原创 2017-06-26 15:50:01 · 251 阅读 · 0 评论 -
leetcode 2Add Two Numbers链表
import java.util.* ;/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution{原创 2015-06-23 17:12:15 · 360 阅读 · 0 评论