三分地

使用 scapy 爬取数据时，经常遇到 IP 被限制，在一些 VPS 上使用 adsl 重连可以达到切换 IP 的目的。 在 windows 上可以使用以下命令连接或断开 adsl。rasdial ADSL user_name password #连接rasdial ADLS /d #断开为了方便，使用以下 python 脚本定时控制：#coding:utf-8import osimport

工作中需要定时自动发送一个邮件报表，使用 HTML、CSS 编写正文。为了减少代码量，在外部 style 中定义如下：td {border:1px solid;}这种写法在 foxmail 上显示的邮件是正常的，但在 outlook 上邮件显示没有边框，于是在每一个 td 加上 border 属性，发现边框分别出现，即每两格之间的边框都出现，非常难看。按照如下编写则会正常显示： table 有一个

需求：有一个数据库，其中一些表每天写入百万条。现要求将某段时间的表数据保存到本地。最开始使用fetchall()，导致服务器直接宕机。如果使用mysqldump命令，会锁表，导致不能写入数据。后来发现python 的MySQLdb提供了fetchmany()的函数，可以控制每次获取的行数。以下的代码可以根据where条件读取数据库，而不给服务器造成很大压力。# coding=utf-8# crea

kaggle.com上的数据集有时候会比较大 ，而且没有提供网盘下载机制，国内下载速度非常慢，同时下载需要验证，也无法使用迅雷工具下载。kaggle论坛上看到有wget的下载方式介绍[1]： 做法是先登录kaggle.com，记下浏览器中的cookie，将cookie保存到cookies.txt中，执行如下命令：wget -x --load-cookies cookies.txt -P

“全国法院失信被执行人名单”，网址：http://shixin.court.gov.cn/，可供查询，用于惩罚失信人员。数据量有100多万，也算是大数据了。其中身份证号已被处理，并不能直接看到全部号码。本人承诺不将此数据用于非法用途和不正当用途，仅作为个人学习数据处理分析的数据源，不针对任何个人和组织。数据字段如下： 被执行人姓名/名称 性别 年龄 身份证号码/组织机构代码

MovieLens 100k数据包含有100，000条用户与电影的相关数据。 首先下载并解压数据：wget http://files.grouplens.org/datasets/movielens/ml-100k.zipunzip ml-100k.zipcd ml-100k#用户文件(ID,年龄,性别,职业,邮编)zhf@ubuntu:~/Downloads/ml-100k$ head

Zeppelin是一个Apache的孵化项目，一个多用途笔记本。(类似于ipython notebook，可以直接在浏览器中写代码、笔记并共享) 可实现你所需要的： - 数据采集 - 数据发现 - 数据分析 - 数据可视化和协作支持多种语言，默认是scala(背后是spark shell)，SparkSQL, Markdown 和 Shell。 甚至可以添加自己的语言支持。如何写一个

通过成功地SQL注入，可能可以拿到目标数据库的全部信息！首先要找到目标网址，以进行漏洞测试。在google中搜索：inurl:news.php?id=2任意点入一个网址：在网址后追加SQL语句，如果报错，则OK，可注入，如果未报错，无可注入漏洞或未找到。 比如，找到一个网址：http://www.calidus.ro/en/news.php?id=2将此链接变成如下，去访问

收集到很多易迅网的商品ID，于是想把这些ID对应的商品信息爬下来。通过简单分析发现，易迅网的各类信息都是直接放在HTML页面上，所以，解析一个页面就好了。最后返回每个ID对应的商品url,标题,易迅价,促销价，类目 。下面是python代码：#!/usr/bin/env python#coding:utf-8'''Created on 2015年03月11日@author: z

一名安全研究员发布了一份包含1000万条记录的用户名、密码文件。原文可见：Today I Am Releasing Ten Million Passwords下载下来看看：确实是刚好有1000万条记录$ wc -l 10-million-combos.txt 10000000 10-million-combos.txt共有两列，分别是username、password$

日志字段格式：id,ip,url,ref,cookie,time_stamp把日志文件放到HDFS。仅取了1000行。hadoop fs -put 1000_log hdfs://localhost:9000/user/root/input计算PV。scala> val textFile = sc.textFile("hdfs://localhost:9000/user/ro

Classify the sentiment of sentences from the Rotten Tomatoes dataset题目链接：https://www.kaggle.com/c/sentiment-analysis-on-movie-reviews越来越喜欢iPython notebook了。以下所有工作都可以在一个页面上完成，FireFox支持比Chrome

Classify handwritten digits using the famous MNIST dataThis competition is the first in a series of tutorial competitions designed to introduce people to Machine Learning.The goal in this comp

User-Agent，用户代理。用户在上网访问的时候会作为HTTP的包头的一部分向服务器发送，用于识别用户的当前环境，如浏览器及版本号、操作系统等信息。在Chrome中可以在访问网站的时候按下F12查看。比如我在使用的Chrome的User-Agent：Mozilla/5.0 (Windows NT 6.1; WOW64) AppleWebKit/537.36 (KHTML, like G

工作中需要分析一些链接，统计分析一些信息。比如如下的链接：http://lightapplication.xxxx.com/?utm_source=ucweb&utm_medium=cpt&utm_term=zhilian&utm_content=textlink&utm_campaign=nov这个链接中带有一些参数，这些参数是什么意思呢，一直很好奇，现在需要用到这些信息了，对于网站主，

The sinking of the RMS Titanic is one of the most infamous shipwrecks in history.  On April 15, 1912, during her maiden voyage, the Titanic sank after colliding with an iceberg, killing 1502 out of 22

Predict a biological response of molecules from their chemical properties从分子的化学属性中预测其生物反应。The objective of the competition is to help us build as good a model as possible so that we can, as op

Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For exa

Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:Did

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

Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest

Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest

Implement int sqrt(int x).Compute and return the square root of x.原题链接：https://oj.leetcode.com/problems/sqrtx/使用二分法来解题。 public int sqrt(int x) { if(x == 0 || x== 1) return x; in

Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the

Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.原题链接：https://oj.leetcode.com/proble

The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [

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 maximum jump length at that position.Determine i

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]

Implement pow(x, n).原题链接：https://oj.leetcode.com/problems/powx-n/ public double pow(double x, int n) { if(n== 0) return 1; if(n == 1) return x; if(n % 2 ==0) return pow(x*x,n/2);

Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.原题链接：https://oj.leetcode.com/problems/anagrams/易位构词游戏的英文词汇是 anagram，这个词来源于有

Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.原题链接：https://oj.leetcode.com/problems

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combina

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited numb

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get

Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguo

The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as 

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fille

想要从日志数据中分析一下操作系统、浏览器、版本使用情况，但是hive中的函数不能直接解析useragent,于是可以写一个UDF来解析。useragent用于表示用户的当前操作系统，浏览器版本信息，形如：Mozilla/5.0 (Windows NT 6.1; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/31.0.1650.63 S

Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.原题链接：https://oj.leetcode.com/problems/n-queens-ii/题目：求有多少个独立的解决方案

The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.

如图，这里只能看到简单的一段SQL，几乎看不出具体在执行什么任务。此时可以点开一个application，点击Tracking URL:ApplicationMaster进入到MapReduce Job job_1409xxxx，Job页面点击左侧的Configuration这里有此Job对应的所有参数，在 右上角的搜索框中输入string,其中key为 hive.

Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3Return 6.

Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.原题链接：https://oj.leetcode.com/problems/construct-bi

Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.原题链接：https://oj.leetcode.com/problems/construct-binary-

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1 3

You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?原题链接：https://oj.leetcode.com/problems/rotate-image/

Divide two integers without using multiplication, division and mod operator.原题链接：https://oj.leetcode.com/problems/divide-two-integers/题目：两数相除，不使用乘法、除法和模运算。思路：只能使用减法了，还有位运算可以当成乘除法来用。开始做的时候用

Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and [2,1,1].

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.原题链接:https://oj.leetcode.com/problems/merge-k-sorted-lists/题目：归并 k 个有序链表，返回一个有序链表。思路：之前有做过归并

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is

使用Python的MySQLdb模块连接并操作MySQL的时候，对于中文，查询时候查不出来，插入数据时候是乱码。很头疼。最后的解决办法如下：conn = MySQLdb.connect(...)cur = conn.cursor()cur.execute("SET NAMES utf8;") cur.execute("SET CHARACTER SET utf8;") cur.exec

输入数据如下：以\t分隔0-3岁育儿百科 书 230-5v液位传感器 50-5轴承 20-6个月奶粉 230-6个月奶粉c2c报告 230-6个月奶粉在线购物排名 230-6个月奶粉市场前景 230-6个月配方奶粉 230.001g电子天平 50.01t化铝炉 20.01吨熔铝合金炉 20.03吨化镁炉

Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:Element

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.原题链接：题目：给定一个m * n 的矩阵，如果有一个元素是0，将其所在行和列设为0.思路：先记录下是0 的元素的位置，再去置0. public void setZeroes(int[][] m

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 from left to right.The first integer of each

有如图所示的输入文件。其中第一列代表ip地址，之后的偶数列代表搜索词，数字(奇数列)代表搜索次数，使用"\t"分隔。现在需要对搜索词进行分词并统计词频，此处不考虑搜索次数，可能是翻页，亦不考虑搜索链接的行为。

这是我的网站www.iyizhan.com，其中只有一个页面index.html，在index.html上放置了如下的 js 脚本：src="http://s11.cnzz.com/stat.php?id=5364825&web_id=5364825" language="JavaScript">1.当用户访问这个页面时,会请求src,对应的是上面的脚本的源文件：

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers

The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.原题链接：https://oj.leetcode.com/problems/merge-two-sorted-

Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements fro

Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio

Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].原题链接：https://oj

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.原题链接：https://oj.leetcode.com/problems/convert-sorted-list-to-binary-search-tree/题目：给定一个

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.原题链接：https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/题目：给定一个升序排列元素的数组，将

You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?原题链接：https://oj.leetcode.com/problems/rotate-image/

Sort a linked list using insertion sort.原题链接：https://oj.leetcode.com/problems/insertion-sort-list/题目：用插入排序对一个链表排序。 public ListNode insertionSortList(ListNode head) { ListNode newHead = new L

Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be non

Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the

在Hive中，需要实现Hive中的函数无法实现的功能时，就可以用Streaming来实现。其原理可以理解成：用HQL语句之外的语言，如Python、Shell来实现这些功能，同时配合HQL语句，以实现特殊的功能。比如，我有一张不同网站访问的日志表，其中有两个列是url和ref，分别代表当前访问的网址和来源地址，我想要查看用户的来源，即看用户都是从那些网站跳到这些网站上去的，这里有些网站可能域名

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] ha

Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use constant

虽然 Hadoop 在分布式数据分析方面备受关注，但是仍有一些替代产品提供了优于典型 Hadoop 平台的令人关注的优势。Spark 是一种可扩展的数据分析平台，它整合了内存计算的基元，因此，相对于 Hadoop 的集群存储方法，它在性能方面更具优势。Spark 是在 Scala 语言中实现的，并且利用了该语言，为数据处理提供了独一无二的环境。了解 Spark 的集群计算方法以及它与 Hado

题目： 给定一个二叉树(假设是完全二叉树)，把每个节点的next指针指向其右侧节点。 思路：首先想到的是，层序遍历树，在遍历的同时添加节点对右侧节点的指针。另一种简洁的方法是采用递归来实现，间单直观。

题目：给定一个排好序的整数数组，找到给定目标值的出现的首尾位置。思路：二分查找。由于是有序数组，所以相同值的数是连续的，即只要找到其中一个，再向左右找到边界值就可以了，这三步均采用二分查找。

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \