Skip to content

Commit dabf260

Browse files
committed
Wrap task description links in javadoc into <a href> tags
1 parent 226521b commit dabf260

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

51 files changed

+58
-54
lines changed

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111

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

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99

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

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99

1010
/**
1111
* <pre>
12-
* https://leetcode.com/problems/lru-cache/
12+
* <a href="https://leetcode.com/problems/lru-cache/">Task description</a>
1313
*
1414
* Design and implement a data structure for Least Recently Used (LRU) cache.
1515
*

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

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

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
/**
44
* <pre>
5-
* https://leetcode.com/problems/remove-duplicates-from-sorted-array/
5+
* <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array/">Task description</a>
66
*
77
* Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each
88
* 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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

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

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55

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

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88

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

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55

66
/**
77
* <pre>
8-
* https://leetcode.com/problems/rotate-list/
8+
* <a href="https://leetcode.com/problems/rotate-list/">Task description</a>
99
*
1010
* Given the head of a linked list, rotate the list to the right by k places.
1111
*

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77

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

0 commit comments

Comments
 (0)