From 9aa2605fed70ba3aa52645fef60cfdd317f1918b Mon Sep 17 00:00:00 2001 From: Valentyn Kolesnikov Date: Sun, 5 May 2024 16:52:41 +0300 Subject: [PATCH] Fixed Idea warnings --- build.gradle | 10 +--------- .../java/g0001_0100/s0002_add_two_numbers/readme.md | 2 +- .../readme.md | 2 +- 3 files changed, 3 insertions(+), 11 deletions(-) diff --git a/build.gradle b/build.gradle index 9e8becc0c..0c0c45e32 100644 --- a/build.gradle +++ b/build.gradle @@ -33,15 +33,7 @@ java { withJavadocJar() } -publishing { - publications { - maven(MavenPublication) { - from(components.java) - } - } -} - -tasks.withType(JavaCompile) { +tasks.withType(JavaCompile).configureEach { options.encoding = 'UTF-8' } diff --git a/src/main/java/g0001_0100/s0002_add_two_numbers/readme.md b/src/main/java/g0001_0100/s0002_add_two_numbers/readme.md index 07741612a..77abd6701 100644 --- a/src/main/java/g0001_0100/s0002_add_two_numbers/readme.md +++ b/src/main/java/g0001_0100/s0002_add_two_numbers/readme.md @@ -122,7 +122,7 @@ public class Solution { solution.printList(result2); ListNode l5 = new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9))))))); - ListNode l6 = new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9))))); + ListNode l6 = new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9)))); ListNode result3 = solution.addTwoNumbers(l5, l6); System.out.print("Example 3 Output: "); solution.printList(result3); diff --git a/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/readme.md b/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/readme.md index 006bfdd1b..ffa185d1f 100644 --- a/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/readme.md +++ b/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/readme.md @@ -63,7 +63,7 @@ class Solution { } // Recursive helper method to construct binary tree - private TreeNode build(int[] preorder, int[] inorder, int preStart, preEnd, int inStart, int inEnd) { + private TreeNode build(int[] preorder, int[] inorder, int preStart, int preEnd, int inStart, int inEnd) { if (preStart > preEnd || inStart > inEnd) return null; // Base case int rootValue = preorder[preStart]; // Root node value