feat: add solutions to lc problem: No.3777

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This pull request adds solutions for LeetCode problem #3777 "Minimum Deletions to Make Alternating Substring", a hard-level problem from Weekly Contest 480. The PR provides comprehensive solutions across multiple programming languages using a Binary Indexed Tree (Fenwick Tree) approach.

Key Changes

• Implemented Binary Indexed Tree-based solution with O((n + q) log n) time complexity
• Added problem descriptions and detailed explanations in both Chinese and English
• Provided solution implementations in Python, Java, C++, Go, and TypeScript

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
README.md	Chinese problem description, constraints, examples, and solution explanation with Binary Indexed Tree approach
README_EN.md	English translation of problem description, constraints, examples, and solution explanation
Solution.py	Python implementation using Binary Indexed Tree to efficiently handle flip and query operations
Solution.java	Java implementation with pre-counting of type-2 queries for result array sizing
Solution.cpp	C++ implementation using vectors and Binary Indexed Tree
Solution.go	Go implementation with Binary Indexed Tree (contains operator precedence issue)
Solution.ts	TypeScript implementation following the same algorithmic approach

Note: I identified a critical bug in the Go implementation (lines 47 and 52) where operator precedence causes incorrect evaluation of the delta calculation. However, I'm unable to create inline code comments as the actual PR diff context is not available in my current environment. The issue is that nums[j] ^ 1 - nums[j] evaluates as nums[j] ^ (1 - nums[j]) instead of the intended (nums[j] ^ 1) - nums[j] due to Go's operator precedence rules where XOR has lower precedence than subtraction.

---

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