Wrap task description links in javadoc into <a href> tags

Author: andrei-punko

src/main/java/by/andd3dfx/cache/LFUCacheUsingLinkedHashSet.java

@@ -11,7 +11,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/lfu-cache/
+ * <a href="https://leetcode.com/problems/lfu-cache/">Task description</a>
  *
  * Design and implement a data structure for Least Frequently Used (LFU) cache.
  * It should support the following operations: get and put.

src/main/java/by/andd3dfx/cache/LFUCacheUsingTime.java

@@ -9,7 +9,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/lfu-cache/
+ * <a href="https://leetcode.com/problems/lfu-cache/">Task description</a>
  *
  * Design and implement a data structure for Least Frequently Used (LFU) cache.
  * It should support the following operations: get and put.

src/main/java/by/andd3dfx/cache/LRUCache.java

@@ -9,7 +9,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/lru-cache/
+ * <a href="https://leetcode.com/problems/lru-cache/">Task description</a>
  *
  * Design and implement a data structure for Least Recently Used (LRU) cache.
  *

src/main/java/by/andd3dfx/collections/ContainsDuplicates.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/contains-duplicate/
+ * <a href="https://leetcode.com/problems/contains-duplicate/">Task description</a>
  *
  * Given an integer array nums, return true if any value appears at least twice in the array,
  * and return false if every element is distinct.

src/main/java/by/andd3dfx/collections/RemoveDuplicatesFromSortedArray.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-duplicates-from-sorted-array/
+ * <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array/">Task description</a>
  *
  * Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each
  * unique element appears only once. The relative order of the elements should be kept the same. Then return

src/main/java/by/andd3dfx/collections/RemoveDuplicatesFromSortedArray_II.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
+ * <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/">Task description</a>
  *
  * Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique
  * element appears at most twice. The relative order of the elements should be kept the same.

src/main/java/by/andd3dfx/collections/RemoveDuplicatesFromSortedLinkedList.java

@@ -5,7 +5,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-duplicates-from-sorted-list/
+ * <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list/">Task description</a>
  *
  * Given the head of a sorted linked list, delete all duplicates such that each element appears only once.
  * Return the linked list sorted as well.

src/main/java/by/andd3dfx/collections/RemoveDuplicatesFromSortedLinkedList_II.java

@@ -8,7 +8,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
+ * <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/">Task description</a>
  *
  * Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers
  * from the original list. Return the linked list sorted as well.

src/main/java/by/andd3dfx/collections/RotateLinkedList.java

@@ -5,7 +5,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/rotate-list/
+ * <a href="https://leetcode.com/problems/rotate-list/">Task description</a>
  *
  * Given the head of a linked list, rotate the list to the right by k places.
  *

src/main/java/by/andd3dfx/common/BracketsExpressionValidator.java

@@ -7,7 +7,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/valid-parentheses/description/
+ * <a href="https://leetcode.com/problems/valid-parentheses/description/">Task description</a>
  *
  * Есть скобочное выражение с разными видами скобок: {}, (), [], <>.
  * Проверить, что оно правильное.