NeetCode #621LC-1553HardGraphs
← Back to All Problems#621 · #1553 · Minimum Number of Days to Eat N Oranges(吃掉 N 个橘子的最少天数)
📌 Problem Statement & Constraints
There are
n oranges. Each day you may: eat one orange, eat n/2 oranges if n is divisible by 2, or eat 2n/3 oranges if n is divisible by 3. Return the minimum number of days to eat all n oranges. Constraints: 1 <= n <= 2 * 10^9.🔒
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!