zoukankan      html  css  js  c++  java
  • python3 requests 获取 拉勾工作数据

     1 #-*- coding:utf-8 -*-
     2 __author__ = "carry"
     3 
     4 import requests,json
     5 
     6 for x in range(1, 15):
     7     url ='http://www.lagou.com/jobs/positionAjax.json'
     8     #proxies = {"http":"http://125.105.17.229:808"}
     9     headers={'User-Agent':'Mozilla/5.0 (Windows NT 6.1; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/50.0.2661.102 Safari/537.36'}
    10     payload = {"city":"杭州", "district":"西湖区", "needAddtionalResult":"false", "first":"true", "pn":x, "kd":"测试"}
    11     result = requests.post(url,data=payload,headers=headers)
    12     #result = requests.post(url,data=payload,proxies=proxies)
    13     result_json = result.json()
    14     print(result_json)
    15 
    16     l = result_json["content"]["positionResult"]["result"]
    17     for x in l:
    18         s = "岗位名称:%s,公司名:%s,业务:%s,工作年限:%s,工资:%s" 
    19         % (x["positionName"],x["companyFullName"],x["industryField"],x["workYear"],x["salary"])
    20 
    21         with open("D:\lagou.txt", "a+", encoding="utf-8") as f:
    22             f.write(s)
    23             f.write("
    ")
  • 相关阅读:
    算法提高 12-1三角形
    poj3723_Conscription
    算法提高 8-1因式分解
    算法提高 道路和航路
    算法训练 安慰奶牛
    最短路问题(Bellman/Dijkstra/Floyd)
    最小生成树 prime+heap
    算法训练 最短路
    算法训练 最大的算式
    poj3255 Roadblocks
  • 原文地址:https://www.cnblogs.com/lxs1314/p/7113509.html
Copyright © 2011-2022 走看看