Find the largest palindrome From the product of two 3-digit numb
- 时间:2020-09-10 12:55:33
- 分类:网络文摘
- 阅读:93 次
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.
To check if a number in Javascript is palindrome, we can convert it to String, then split into char array, reverse the array, and join as a string, then a palindrome is a string that its reverse is the same.
1 2 3 4 5 6 7 8 9 10 11 12 13 | let ans = 0; for (let i = 999; i >= 100; i --) { for (let j = 999; j >= 100; j --) { let num = i * j; let s = String(num); let rs = s.split('').reverse().join(''); if (s === rs) { ans = Math.max(ans, num); } } } console.log(ans); |
let ans = 0; for (let i = 999; i >= 100; i --) { for (let j = 999; j >= 100; j --) { let num = i * j; let s = String(num); let rs = s.split('').reverse().join(''); if (s === rs) { ans = Math.max(ans, num); } } } console.log(ans);
Two loops each range from 100 to 999 for 3-digit number. Then we check the product and record the maximum palindrome.
The answer is: 906609.
–EOF (The Ultimate Computing & Technology Blog) —
推荐阅读:5 Tips to Drive Traffic to Your Blog Ideas to Help You Set Up the Home Office of Your Dreams Wix vs Squarespace 2020 – Things You Must Know How to Delete N Nodes After M Nodes of a Linked List? Bruteforce Algorithm to Find the Unique Positive Integer Whose S Clone (Deep Copy) Binary Tree With Random Pointer using Hash Map How to Compute Running Sum of 1d Array using std::partial_sum in How to Renew the Free SSL Certificates (Nginx Server)? Design: How to Solve 503 Error of API when Resources are not ava SteemJs Programming: What Happens on the Steem Blockchain in the
- 评论列表
-
- 添加评论