ProjectEuler/Problem04.java · zscgrhg/Java

代码拉取完成,页面将自动刷新

扫描微信二维码支付

取消

支付完成

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 82

zscgrhg/Java

forked from 编程语言算法集/Java

代码 Issues 0 Pull Requests 0 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (3)

管理

master

Development

nikhilkala-patch-1

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 3

标签 0

Java

ProjectEuler

Problem04.java

Problem04.java 1.42 KB

package ProjectEuler;

/**
 * A palindromic number reads the same both ways. The largest palindrome made from the product of
 * two 2-digit numbers is 9009 = 91 ×ばつ 99.
 *
 * Find the largest palindrome made from the product of two 3-digit numbers.
 *
 * link: https://projecteuler.net/problem=4
 */
public class Problem04 {
 public static void main(String[] args) {

assert solution1(10000) == -1;
 assert solution1(20000) == 19591; /* 19591 == 143*137 */
 assert solution1(30000) == 29992; /* 29992 == 184*163 */
 assert solution1(40000) == 39893; /* 39893 == 287*139 */
 assert solution1(50000) == 49894; /* 49894 == 494*101 */
 assert solution1(60000) == 59995; /* 59995 == 355*169 */
 assert solution1(70000) == 69996; /* 69996 == 614*114 */
 assert solution1(80000) == 79897; /* 79897 == 733*109 */
 assert solution1(90000) == 89798; /* 89798 == 761*118 */
 assert solution1(100000) == 99999; /* 100000 == 813*123 */
 }

private static int solution1(int n) {
 for (int i = n - 1; i >= 10000; --i) {
 String strNumber = String.valueOf(i);

/* Test if strNumber is palindrome */
 if (new StringBuilder(strNumber).reverse().toString().equals(strNumber)) {
 for (int divisor = 999; divisor >= 100; --divisor) {
 if (i % divisor == 0 && String.valueOf(i / divisor).length() == 3) {
 return i;
 }
 }
 }
 }
 return -1; /* not found */
 }
}

一键复制编辑原始数据按行查看历史

github-actions 提交于 2020年10月24日 18:23 +08:00 . Formatted with Google Java Formatter

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41

package ProjectEuler;

/**
 * A palindromic number reads the same both ways. The largest palindrome made from the product of
 * two 2-digit numbers is 9009 = 91 ×ばつ 99.
 *
 * <p>Find the largest palindrome made from the product of two 3-digit numbers.
 *
 * <p>link: https://projecteuler.net/problem=4
 */
public class Problem04 {
 public static void main(String[] args) {

 assert solution1(10000) == -1;
 assert solution1(20000) == 19591; /* 19591 == 143*137 */
 assert solution1(30000) == 29992; /* 29992 == 184*163 */
 assert solution1(40000) == 39893; /* 39893 == 287*139 */
 assert solution1(50000) == 49894; /* 49894 == 494*101 */
 assert solution1(60000) == 59995; /* 59995 == 355*169 */
 assert solution1(70000) == 69996; /* 69996 == 614*114 */
 assert solution1(80000) == 79897; /* 79897 == 733*109 */
 assert solution1(90000) == 89798; /* 89798 == 761*118 */
 assert solution1(100000) == 99999; /* 100000 == 813*123 */
 }

 private static int solution1(int n) {
 for (int i = n - 1; i >= 10000; --i) {
 String strNumber = String.valueOf(i);

 /* Test if strNumber is palindrome */
 if (new StringBuilder(strNumber).reverse().toString().equals(strNumber)) {
 for (int divisor = 999; divisor >= 100; --divisor) {
 if (i % divisor == 0 && String.valueOf(i / divisor).length() == 3) {
 return i;
 }
 }
 }
 }
 return -1; /* not found */
 }
}