刷題-Leetcode-1025. 除數博弈
1025. 除數博弈
題目連結
來源:力扣(LeetCode)
連結:https://leetcode-cn.com/problems/divisor-game/
著作權歸領釦網路所有。商業轉載請聯絡官方授權,非商業轉載請註明出處。
題目描述
愛麗絲和鮑勃一起玩遊戲,他們輪流行動。愛麗絲先手開局。
最初,黑板上有一個數字N。在每個玩家的回合,玩家需要執行以下操作:
選出任一x,滿足0 < x < N 且N % x == 0。
用 N - x替換黑板上的數字 N 。
如果玩家無法執行這些操作,就會輸掉遊戲。
只有在愛麗絲在遊戲中取得勝利時才返回True,否則返回 False。假設兩個玩家都以最佳狀態參與遊戲。
示例 1:
輸入:2 輸出:true 解釋:愛麗絲選擇 1,鮑勃無法進行操作。
示例 2:
輸入:3 輸出:false 解釋:愛麗絲選擇 1,鮑勃也選擇 1,然後愛麗絲無法進行操作。
提示:
1 <= N <= 1000
題目分析
要注意這個最佳狀態。
例如N=4的時候,愛麗絲可以選擇1或2,但是選擇1愛麗絲最後一定會贏,選擇2愛麗絲則會輸。所以選擇1才是愛麗絲的最佳狀態。
相關推薦
刷題-Leetcode-1025. 除數博弈
1025. 除數博弈 題目連結 來源:力扣(LeetCode)連結:https://leetcode-cn.com/problems/divisor-game/著作權歸領釦網路所有。商業轉載請聯絡官方授權,非商業轉載請註明出處。
Leetcode 1025. 除數博弈
地址https://leetcode-cn.com/problems/divisor-game/ 愛麗絲和鮑勃一起玩遊戲,他們輪流行動。愛麗絲先手開局。
【刷題-LeetCode】165 Compare Version Numbers
Compare Version Numbers Compare two version numbers version1 and version2. If *version1* > *version2* return 1; if *version1* < *version2* return -1;otherwise return 0.
【刷題-LeetCode】179 Largest Number
Largest Number Given a list of non negative integers, arrange them such that they form the largest number.
【刷題-LeetCode】122 Best Time to Buy and Sell Stock II
Best Time to Buy and Sell Stock II Say you have an array for which the ith element is the price of a given stock on day i.
【刷題-LeetCode】123 Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock III Say you have an array for which the ith element is the price of a given stock on day i.
【刷題-LeetCode】191 Number of 1 Bits
Number of 1 Bits Write a function that takes an unsigned integer and return the number of \'1\' bits it has (also known as the Hamming weight).
【刷題-LeetCode】199 Binary Tree Right Side View
Binary Tree Right Side View Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
【刷題-LeetCode】200 Number of Islands
Number of Islands Given a 2d grid map of \'1\'s (land) and \'0\'s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or ve
【刷題-LeetCode】201 Bitwise AND of Numbers Range
Bitwise AND of Numbers Range Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.
【刷題-LeetCode】204. Count Primes
Count Primes Count the number of prime numbers less than a non-negative number, *n*. Example: Input: 10 Output: 4
【刷題-LeetCode】208. Implement Trie (Prefix Tree)
Implement Trie (Prefix Tree) Implement a trie with insert, search, and startsWith methods. Example: Trie trie = new Trie();
【刷題-LeetCode】209. Minimum Size Subarray Sum
Minimum Size Subarray Sum Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn\'t one, return 0 instea
【刷題-LeetCode】215. Kth Largest Element in an Array
Kth Largest Element in an Array Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
【刷題-LeetCode】216. Combination Sum III
Combination Sum III Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
【刷題-LeetCode】221. Maximal Square
Maximal Square Given a 2D binary matrix filled with 0\'s and 1\'s, find the largest square containing only 1\'s and return its area.
【刷題-LeetCode】223. Rectangle Area
Rectangle Area Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.
【刷題-LeetCode】224. Basic Calculator
Basic Calculator Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative int
【刷題-LeetCode】236. Lowest Common Ancestor of a Binary Tree
Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
【刷題-LeetCode】239. Sliding Window Maximum
Sliding Window Maximum Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each