feat: add solution to lc problem: No.3562

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This PR adds a complete solution to LeetCode problem #3562 "Maximum Profit from Trading Stocks with Discounts", a hard-level dynamic programming problem from Weekly Contest 451. The problem involves optimizing stock purchases in a company hierarchy where employees can get discounted prices if their direct boss purchases stock.

Key Changes:

• Implements a tree-based DP solution using DFS traversal
• Handles budget constraints and hierarchical discount mechanics
• Provides comprehensive documentation in both Chinese and English

Reviewed changes

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

Show a summary per file

File	Description
Solution.py	Python implementation using custom max lambda and recursive DFS with memoization
Solution.java	Java implementation with instance variables for cleaner recursive calls
Solution.cpp	C++ implementation using lambda with capture for concise DFS logic
Solution.go	Go implementation with closure-based DFS approach
Solution.ts	TypeScript implementation with clear variable naming for readability
README.md	Chinese problem description with examples and constraints
README_EN.md	English problem description with detailed explanations

Technical Approach:
All implementations use a consistent tree DP strategy where f[j][pre] represents the maximum profit achievable with budget j, where pre indicates whether the parent node purchased stock (affecting discount availability). The solutions correctly handle:

• Building the tree structure from the hierarchy array
• Computing optimal stock purchase decisions at each node
• Managing budget allocation across the tree
• Applying the 50% discount when parent purchases stock

Code Quality Notes:

• All implementations follow consistent logic and produce correct results
• The Python solution uses a custom max lambda that shadows the built-in function (a minor style concern but functionally correct)
• Solutions are well-structured with clear separation of tree building and DP computation phases
• Time complexity: O(n × budget² × 2) where n is the number of employees
• Space complexity: O(n + budget) for the recursion stack and DP arrays

The solutions are algorithmically sound and handle all the problem constraints correctly, including edge cases with budget limitations and the hierarchical discount policy.

---

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