如何在不限制数字的情况下指定范围

Question

这是获取餐厅评论的代码。我正在收集评论。你知道吗

指定并导入范围。但有一个问题。每个商店都有不同数量的评论。评论不多的商店应该很快就会去下一家商店。你知道吗

我的视野太大了。但不能缩小范围。这是因为有些商店有这个范围的评论。你知道吗

我怎样才能有效地工作？你知道吗

我看到了找到所有的？（元素）搜索此代码。但是我不知道我是否错误地应用了我的代码。你知道吗

#python3
import sys
from bs4 import BeautifulSoup
import urllib.request
import requests
from urllib.parse import quote
import time
import os
import xlwt
import random

import re

FISRT_URL = "https://www.yelp.com/search?
find_desc=Korean+Food&find_loc=Seattle,+WA&start="
LAST_URL = "&cflt=korean"
def get_link(URL, doc_name):
    global jisu_i
    global num
    global page
    for jisu_i in range(1):
        current_page_num = 20 + jisu_i*10
        position = URL.index('t=')
        URL_with_page_num = URL[: position+2] + str(current_page_num) \
                            + URL[position+2 :]
    print(URL_with_page_num) 
    importurl = URL_with_page_num
    r = requests.get(importurl)
    soup = BeautifulSoup(r.content.decode('euc-kr','replace'), "lxml")
    time.sleep(random.randint(10, 15))

    for title in soup.find_all('h3')[page+2:21]:

        page = page + 1
        title_link = title.select('a')
        for jisu_m in range(130):
            print(page)
            last_URL = title_link[0]['href']
            print(last_URL)

            first_URL = "https://www.yelp.com"
            global article_URL
            article_URL = first_URL + last_URL
            time.sleep(random.randint(15, 30))



            jisuurl = article_URL
            for k in range(99):  #
                jisu_page_num = 0 + k * 20  #
                position = jisuurl.index('?')  
                URL_with_page_num = jisuurl[: position + 1] + str("start=") + str(jisu_page_num)

                jisu_with_page_num = URL_with_page_num
                print(jisu_with_page_num)

                jisu_importurl = jisu_with_page_num
                get_text(URL, jisu_importurl, doc_name)
                time.sleep(random.randint(40,180))

Answer 1

Yelp在这里有一个非常完善的API：https://www.yelp.com/developers/documentation/v3

这是通过编程与站点交互的唯一可靠方式。你知道吗