惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园_首页
I
InfoQ
The Register - Security
The Register - Security
L
LangChain Blog
H
Help Net Security
The GitHub Blog
The GitHub Blog
S
Schneier on Security
博客园 - 【当耐特】
W
WeLiveSecurity
Attack and Defense Labs
Attack and Defense Labs
IT之家
IT之家
CTFtime.org: upcoming CTF events
CTFtime.org: upcoming CTF events
Google DeepMind News
Google DeepMind News
The Cloudflare Blog
H
Heimdal Security Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Y
Y Combinator Blog
雷峰网
雷峰网
N
Netflix TechBlog - Medium
Security Archives - TechRepublic
Security Archives - TechRepublic
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
L
Lohrmann on Cybersecurity
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
T
The Exploit Database - CXSecurity.com
P
Privacy & Cybersecurity Law Blog
G
GRAHAM CLULEY
Exploit-DB.com RSS Feed
Exploit-DB.com RSS Feed
V
Visual Studio Blog
博客园 - 聂微东
PCI Perspectives
PCI Perspectives
Last Week in AI
Last Week in AI
A
Arctic Wolf
宝玉的分享
宝玉的分享
T
The Blog of Author Tim Ferriss
S
Secure Thoughts
T
Threat Research - Cisco Blogs
GbyAI
GbyAI
云风的 BLOG
云风的 BLOG
D
Darknet – Hacking Tools, Hacker News & Cyber Security
S
SegmentFault 最新的问题
SecWiki News
SecWiki News
月光博客
月光博客
大猫的无限游戏
大猫的无限游戏
Schneier on Security
Schneier on Security
P
Proofpoint News Feed
博客园 - Franky
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
AI
AI
Engineering at Meta
Engineering at Meta

博客园 - 北叶青藤

2096. Step-By-Step Directions From a Binary Tree Node to Another Find path from root to a target node in Binary Tree When Dijkstra Algorithm Should be Use? 1188. Design Bounded Blocking Queue 1115. Print FooBar Alternately 1114. Print in Order 1242. Web Crawler Multithreaded Python Multi-threading Log Rate Limiter Same Word of HTML Labels Most Frequent Call Chain remove prefix in a words list 1102. Path With Maximum Minimum Value Property Booking Optimizer minimum number 755. Pour Water Keyword Tagging in Reviews with Overlapping Matches Retryer Function Implementation 1125. Smallest Sufficient Team Print the terrain Split stay Task scheduling problem 滑雪问题 845. Longest Mountain in Array 723. Candy Crush 1539. Kth Missing Positive Number 1650. Lowest Common Ancestor of a Binary Tree III 424. Longest Repeating Character Replacement 843. Guess the Word 551. Student Attendance Record I
bot ip
北叶青藤 · 2026-04-06 · via 博客园 - 北叶青藤

part 1. 给 时间 和 IP, 看在提供的input里面如果ip 超出了一个threshold,判断为机器人,output 机器人的ip

input: following string, and threshold


1, ip1
1, ip2
1, ip1
4, ip1
4, ip2
5, ip3

isBot(String input, 3) -> ip1
isBot(String input, 2) -> ip1, ip2

isBot(String input, 1) -> ip1, ip2, ip3

part 2. 给 时间 和 IP, 但是有需要看 sliding time window 里面的 ip 数量 超出了一个 threshold,output true/false

# class CheckBot {
#     public CheckBot(int threshold, int windowSize) {

#     }


#     public boolean isBot(int timestamp, String ip) {

#     }

# }

# example:
# Checkbot cb = new CheckBot(threshold = 3, sliding time size = 3);

# isBot(0, ip1) -> false

# isBot(1, ip1) -> false
# isBot(1, ip1) -> true // reached threshold 3 within the time window of 3
# isBot(4, ip2) -> false
# isBot(5, ip1) -> false

 1 from collections import Counter
 2 
 3 def isBot(input_str, threshold):
 4     # Parse the input string into a list of IPs
 5     # We ignore the timestamp for this specific part as per the example
 6     lines = input_str.strip().split('\n')
 7     ips = [line.split(', ')[1] for line in lines if line]
 8     
 9     # Count occurrences
10     counts = Counter(ips)
11     
12     # Filter by threshold
13     bots = [ip for ip, count in counts.items() if count >= threshold]
14     
15     # Sort or format as needed (returning list for clarity)
16     return sorted(bots)
17 
18 # Testing
19 data = """
20 1, ip1
21 1, ip2
22 1, ip1
23 4, ip1
24 4, ip2
25 5, ip3
26 """
27 
28 print(f"Threshold 3: {isBot(data, 3)}") # ['ip1']
29 print(f"Threshold 2: {isBot(data, 2)}") # ['ip1', 'ip2']
30 print(f"Threshold 1: {isBot(data, 1)}") # ['ip1', 'ip2', 'ip3']
 1 from collections import deque, defaultdict
 2 
 3 class CheckBot:
 4     def __init__(self, threshold, window_size):
 5         self.threshold = threshold
 6         self.window_size = window_size
 7         # defaultdict automatically creates a deque for any new IP key
 8         self.history = defaultdict(deque)
 9 
10     def is_bot(self, timestamp, ip):
11         # 1. Add current timestamp (auto-creates deque if ip is new)
12         self.history[ip].append(timestamp)
13         
14         # 2. Remove timestamps that have fallen out of the sliding window
15         # Logic: Window includes [timestamp - window_size + 1, timestamp]
16         # Example: timestamp 4, window 3 -> valid range is [2, 3, 4]. 
17         # Anything <= (4 - 3) i.e. 1 is expired.
18         while self.history[ip] and self.history[ip][0] <= timestamp - self.window_size:
19             self.history[ip].popleft()
20             
21         # 3. Check if count meets or exceeds threshold
22         return len(self.history[ip]) >= self.threshold
23 
24 # --- Example Usage ---
25 cb = CheckBot(threshold=3, window_size=3)
26 
27 print(f"Time 0, ip1: {cb.is_bot(0, 'ip1')}") # False
28 print(f"Time 1, ip1: {cb.is_bot(1, 'ip1')}") # False
29 print(f"Time 1, ip1: {cb.is_bot(1, 'ip1')}") # True (3 hits at/after time -2)
30 print(f"Time 4, ip2: {cb.is_bot(4, 'ip2')}") # False
31 print(f"Time 5, ip1: {cb.is_bot(5, 'ip1')}") # False (Timestamps 0 and 1 expired)