feat: add solutions to lc problem: No.3770

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This PR adds solutions for LeetCode problem 3770 "Largest Prime from Consecutive Prime Sum" across multiple programming languages.

Summary: The problem asks to find the largest prime number ≤ n that can be expressed as the sum of one or more consecutive primes starting from 2. The solution uses preprocessing with the Sieve of Eratosthenes to generate all primes up to 500,000, computes consecutive prime sums, stores those that are prime, and uses binary search for queries.

Key Changes:

• Implements a preprocessing + binary search approach with O(M log log M) preprocessing and O(log k) query time
• Provides solutions in Python, Java, C++, Go, and TypeScript
• Includes comprehensive problem descriptions and explanations in both Chinese and English

Reviewed changes

Copilot reviewed 7 out of 7 changed files in this pull request and generated no comments.

Show a summary per file

File	Description
Solution.py	Python implementation using Sieve of Eratosthenes and bisect_right for binary search
Solution.java	Java implementation with static initialization and Collections.binarySearch
Solution.cpp	C++ implementation using lambda initialization and upper_bound
Solution.go	Go implementation with init function and sort.SearchInts
Solution.ts	TypeScript implementation using IIFE initialization and lodash's sortedIndex
README.md	Chinese problem description, examples, constraints, and solution explanation
README_EN.md	English problem description, examples, constraints, and solution explanation

---

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.