資訊專欄INFORMATION COLUMN
Problem
Given a positive integer n (1 <= n <= 10^18). Check whether a number has exactly three distinct factors, return true if it has exactly three distinct factors, otherwise false.
ExampleGiven n = 9, return true
Number 9 has exactly three factors: 1, 3, 9, so return true.
Given n = 10, return false
Solutionpublic class Solution {
/**
* @param n: the given number
* @return: return true if it has exactly three distinct factors, otherwise false
*/
public boolean isThreeDisctFactors(long n) {
// write your code here
long fac = (long) Math.sqrt(n);
if (fac * fac != n) return false;
for (long i = 2; i < fac; i++) {
if (n % i == 0) return false;
}
return true;
}
}
文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請(qǐng)注明本文地址：http://systransis.cn/yun/69470.html
摘要：用動(dòng)規(guī)方法做建立長度為和的二維數(shù)組，表示的第到位子串包含不同的的第到位子串的個(gè)數(shù)。初始化當(dāng)?shù)淖哟L度為時(shí)，當(dāng)?shù)淖哟L度為時(shí)，當(dāng)和子串都為時(shí)，包含，故。 Problem Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a strin...
Problem Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest palindrome mod 1337. Example Input: 2Output: 987Ex...
Problem Write a program to check whether a given number is an ugly number`. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly ...
摘要：建兩個(gè)新數(shù)組，一個(gè)存數(shù)，一個(gè)存。數(shù)組中所有元素初值都是。實(shí)現(xiàn)的過程是，一個(gè)循環(huán)里包含兩個(gè)子循環(huán)。兩個(gè)子循環(huán)的作用分別是，遍歷數(shù)組與相乘找到最小乘積存入再遍歷一次數(shù)組與的乘積，結(jié)果與相同的，就將加，即跳過這個(gè)結(jié)果相同結(jié)果只存一次。 Problem Write a program to find the nth super ugly number. Super ugly numbers a...
Problem Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute dif...
閱讀 1014·2021-09-30 09:58
閱讀 2848·2021-09-09 11:55
閱讀 2010·2021-09-01 11:41
閱讀 1003·2019-08-30 15:55
閱讀 3362·2019-08-30 12:50
閱讀 3508·2019-08-29 18:37
閱讀 3310·2019-08-29 16:37
閱讀 2023·2019-08-29 13:00
