Skip to content

Added tasks 2217, 2218, 2220, 2222, 2223 #1119

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Jun 12, 2022
Merged

Added tasks 2217, 2218, 2220, 2222, 2223 #1119

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
6042124
Added tasks 2217, 2218, 2220, 2222, 2223
ThanhNIT Jun 12, 2022
7a1404a
fix smells
ThanhNIT Jun 12, 2022
50c9ae4
Update Solution.java
javadev Jun 12, 2022
581beb2
Update Solution.java
javadev Jun 12, 2022
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Update Solution.java
  • Loading branch information
@javadev
javadev authored Jun 12, 2022
commit 581beb241deaa815c99f1191fcbd86bdd6f23895
5 changes: 3 additions & 2 deletions src/main/java/g2201_2300/s2217_find_palindrome_with_fixed_length/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,10 +2,11 @@

// #Medium #Array #Math #2022_06_12_Time_37_ms_(88.60%)_Space_53.7_MB_(77.19%)

@SuppressWarnings("java:S2184")
public class Solution {
public long[] kthPalindrome(int[] queries, int intLength) {
long minHalf = (long) Math.pow(10, (intLength - 1) / 2D);
long maxIndex = (long) Math.pow(10, (intLength + 1) / 2D) - minHalf;
long minHalf = (long) Math.pow(10, (intLength - 1) / 2);
long maxIndex = (long) Math.pow(10, (intLength + 1) / 2) - minHalf;
boolean isOdd = intLength % 2 == 1;
long[] res = new long[queries.length];
for (int i = 0; i < res.length; i++) {
Expand Down