当前位置: 首页 > news >正文

力扣竞赛勋章 | 排名分数计算脚本

文章目录

  • 力扣竞赛勋章介绍
  • 竞赛评分算法
  • 脚本(本文的重点内容)
  • 运行结果

代码修改自:https://leetcode.cn/circle/discuss/6gnvEj/
原帖子的代码无法正常运行。

力扣竞赛勋章介绍

https://leetcode.cn/circle/discuss/0fKGDu/

在这里插入图片描述

如果你想知道自己上多少分可以拿到对应的勋章,那么篇文章会解决你的问题!

竞赛评分算法

https://leetcode.cn/circle/article/neTUV4/

脚本(本文的重点内容)

#!/usr/bin/env python3import json
import sysimport requests# 力扣目前勋章的配置
RATING = 1600       # 从1600分以上才开始算人
GUARDIAN = 0.05
KNIGHT = 0.25
# 查询的地址为全国还是全球?很关键
GLOBAL = False
# 二分查找的右端点(可自调)
RIGHT = 3000def fetch_lastest_ranking(mode):l, r = 1, RIGHTretry_cnt = 0ansRanking = Nonewhile l < r:cur_page = (l + r + 1) // 2try:payload = RankingCrawler._REQUEST_PAYLOAD_TEMPLATE.copy()payload['query'] = payload['query'].replace('page: 1', 'page: {}'.format(cur_page))resp = requests.post(RankingCrawler.URL,headers={'Content-type': 'application/json'},json=payload).json()resp = resp['data']['localRanking'] if not GLOBAL else resp['data']['globalRanking']# no more dataif len(resp['rankingNodes']) == 0:breakif not mode:top = int(resp['rankingNodes'][0]['currentRating'].split('.')[0])if top < RATING:r = cur_page - 1else:l = cur_pageansRanking = resp['rankingNodes']else:top = int(resp['rankingNodes'][0]['currentGlobalRanking'])if top > mode:r = cur_page - 1else:l = cur_pageansRanking = resp['rankingNodes']print('The first contest current rating in page {} is {} .'.format(cur_page, resp['rankingNodes'][0]['currentRating']))retry_cnt = 0except:print(f'Failed to retrieved data of page {cur_page}...retry...{retry_cnt}')retry_cnt += 1ansRanking = ansRanking[::-1]last = Noneif not mode:while ansRanking and int(ansRanking[-1]['currentRating'].split('.')[0]) >= 1600:last = ansRanking.pop()else:while ansRanking and int(ansRanking[-1]['currentGlobalRanking']) <= mode:last = ansRanking.pop()return lastclass RankingCrawler:URL = 'https://leetcode.com/graphql' if GLOBAL else 'https://leetcode-cn.com/graphql'_REQUEST_PAYLOAD_TEMPLATE = {"operationName": None,"variables": {},"query":r'''{localRanking(page: 1) {totalUsersuserPerPagerankingNodes {currentRatingcurrentGlobalRanking}}}''' if not GLOBAL elser'''{globalRanking(page: 1) {totalUsersuserPerPagerankingNodes {currentRatingcurrentGlobalRanking}}}'''}if __name__ == "__main__":crawler = RankingCrawler()ans = fetch_lastest_ranking(0)n = int(ans['currentGlobalRanking'])guardian = fetch_lastest_ranking(int(GUARDIAN * n))knight = fetch_lastest_ranking(int(KNIGHT * n))if not GLOBAL:guardian['currentCNRanking'] = guardian['currentGlobalRanking']guardian.pop('currentGlobalRanking')knight['currentCNRanking'] = knight['currentGlobalRanking']knight.pop('currentGlobalRanking')print("Done!")print()print("目前全{}1600分以上的有{}人".format("球" if GLOBAL else "国", n))print("根据这个人数,我们得到的Guardian排名及分数信息为:{}".format(guardian))print("根据这个人数,我们得到的Knight排名及分数信息为:{}".format(knight))sys.exit()

运行结果

运行结果大致如下:

C:\Users\fengwei\anaconda3\python.exe D:/study_folder/研究生课程/深度学习/my_work/论文分享/leetcode.py
The first contest current rating in page 1501 is 1557 .
The first contest current rating in page 751 is 1676 .
The first contest current rating in page 1126 is 1603 .
The first contest current rating in page 1313 is 1578 .
Failed to retrieved data of page 1219...retry...0
The first contest current rating in page 1219 is 1589 .
The first contest current rating in page 1172 is 1596 .
The first contest current rating in page 1149 is 1599 .
The first contest current rating in page 1137 is 1601 .
The first contest current rating in page 1143 is 1600 .
The first contest current rating in page 1146 is 1599 .
The first contest current rating in page 1144 is 1600 .
The first contest current rating in page 1145 is 1600 .
The first contest current rating in page 1501 is 1557 .
The first contest current rating in page 751 is 1676 .
The first contest current rating in page 376 is 1821 .
The first contest current rating in page 188 is 1978 .
The first contest current rating in page 94 is 2143 .
The first contest current rating in page 47 is 2308 .
The first contest current rating in page 70 is 2216 .
The first contest current rating in page 58 is 2260 .
The first contest current rating in page 64 is 2238 .
The first contest current rating in page 61 is 2249 .
The first contest current rating in page 59 is 2257 .
The first contest current rating in page 1501 is 1557 .
The first contest current rating in page 751 is 1676 .
The first contest current rating in page 376 is 1821 .
The first contest current rating in page 188 is 1978 .
The first contest current rating in page 282 is 1887 .
The first contest current rating in page 329 is 1851 .
The first contest current rating in page 305 is 1870 .
The first contest current rating in page 293 is 1878 .
The first contest current rating in page 287 is 1883 .
The first contest current rating in page 290 is 1881 .
The first contest current rating in page 288 is 1882 .
Done!目前全国1600分以上的有28612人
根据这个人数,我们得到的Guardian排名及分数信息为:{'currentRating': '2260', 'currentCNRanking': 1430}
根据这个人数,我们得到的Knight排名及分数信息为:{'currentRating': '1883', 'currentCNRanking': 7153}Process finished with exit code 0

可以看出 1883 以上可以得到 Knight
2260 以上可以得到 Guardian

http://www.lryc.cn/news/94605.html

相关文章:

  • win10 远程 ubuntu 18.04 桌面
  • c++ -- STL
  • 文字识别(OCR)介绍与开源方案对比
  • Modbus tcp转ETHERCAT在Modbus软件中的配置方法
  • 开源点云数据集整理汇总
  • 【全栈开发指南】VUE前端路由设计及配置
  • C语言程序环境和预处理
  • 为摸鱼助力:一份Vue3的生成式ElementPlus表单组件
  • 数通工作中常见问题与解决方法
  • 基于STM32+华为云IOT设计的智能浇花系统
  • 回调函数(callback)是什么?
  • 零代码量化投资:用ChatGPT获取新浪财经上的股票实时行情
  • 从GitLab拉取并运行项目
  • AI绘画结合GPT 把Ai绘画与摄影玩明白
  • 哈工大计算机网络课程数据链路层协议详解之:多路访问控制(MAC)协议
  • docker基本概念和相关命令
  • 43. 间断连续登录用户问题
  • Visual Studio Code 编辑器实用插件简介
  • 微信小程序之Image那些事
  • 【MySQL】不就是子查询
  • gpt4实现对摄像头帧缓冲区图像的LAB阈值选择界面(python-opencv)
  • Stable Diffusion WebUI 集成 LoRA模型,给自己做一张壁纸 Ubuntu22.04 rtx2060 6G
  • Flink 读写Kafka总结
  • LiDAR SLAM 闭环——BoW3D论文详解
  • Android NTP时间同步源码分析
  • 数据库之MySQL字符集与数据库操作
  • 搜索引擎概念解析
  • 网页链接投票链接步骤公众号投票链接制作制作投票
  • 【通信安全CACE-管理类基础级】第7章 安全运维
  • 随手笔记——将ROS图像话题转为OpenCV图像格式处理后再转为ROS图像话题发布(Python版)