Python 基礎知識簡單

自守數

“自同構數”問題的詳細指南和 Python 實作。

問題陳述

簡單

寫一個函數 is_automorphic(n) ,它接受非負整數 n ,如果 n 是自同構數,則傳回 True ,否則傳回 False 。自守數是其平方以該數本身結尾的數。例如,25 是自同構,因為 25^2 = 625,以 25 結尾。

約束條件
  • 0 <= n <= 10^6

範例

Example 1
Input
n = 25
Output
True
Explanation

25^2 = 625. The last two digits of 625 are 25, which matches n.

Example 2
Input
n = 76
Output
True
Explanation

76^2 = 5776. The last two digits of 5776 are 76, which matches n.

Example 3
Input
n = 13
Output
False
Explanation

13^2 = 169. The last two digits of 169 are 69, which does not match 13.

Need a Hint?
考慮使用特定於基礎的資料結構,例如集合或堆。
Edge Cases to Watch
  • 空輸入結構
  • 單元素輸入
  • 大數值範圍

準備好解決了嗎?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在編輯器中開啟
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推薦的 Python 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。