NeetCode #725LC-1140Medium2-D Dynamic ProgrammingNC 250
← Back to All Problems

#725 · #1140 · Stone Game II(石子游戏 II)

📌 Problem Statement & Constraints

Alice and Bob take turns taking piles from the front of piles. On a turn a player takes X piles with 1 <= X <= 2M, then M becomes max(M, X), with M starting at 1. Each player maximises their own total. Return the maximum number of stones Alice can get. Constraints: 1 <= piles.length <= 100, 1 <= piles[i] <= 10^4.
🔒

Sign In to Unlock Full Solutions for All 973 Problems

Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!