Skip to content

Commit 7d1768e

Browse files
Bota5kyBota5ky
committed
convert language level to 1.8
1 parent 1b779e3 commit 7d1768e

File tree

64 files changed

+236
-207
lines changed

Some content is hidden

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

64 files changed

+236
-207
lines changed

‎.gitignore

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
11
/leetcode.iml
22
/Solution.java
3+
/Main.java
34
out/
45
.idea

‎_model/ListNode.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,8 +9,8 @@ public ListNode(int x) {
99
}
1010

1111
public static ListNode create(int[] nums) {
12-
var head = new ListNode(-1);
13-
var node = head;
12+
ListNode head = new ListNode(-1);
13+
ListNode node = head;
1414
for (int num : nums) {
1515
node.next = new ListNode(num);
1616
node = node.next;

‎_model/TreeNode.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -24,11 +24,11 @@ public static TreeNode create(int[] nums) {
2424
if (nums.length == 0) {
2525
return null;
2626
}
27-
var root = new TreeNode(nums[0]);
28-
var layer = new ArrayList<TreeNode>();
27+
TreeNode root = new TreeNode(nums[0]);
28+
ArrayList<TreeNode> layer = new ArrayList<TreeNode>();
2929
layer.add(root);
3030
for (int i = 1; i < nums.length;) {
31-
var nextLayer = new ArrayList<TreeNode>();
31+
ArrayList<TreeNode> nextLayer = new ArrayList<TreeNode>();
3232
for (TreeNode treeNode : layer) {
3333
treeNode.left = new TreeNode(nums[i++]);
3434
nextLayer.add(treeNode.left);

‎array/product_of_array_except_self/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
*/
88
class Solution {
99
public int[] productExceptSelf(int[] nums) {
10-
var res = new int[nums.length];
10+
int[] res = new int[nums.length];
1111
res[0] = 1;
1212
for (int i = 1, pre = nums[0]; i < nums.length; i++) {
1313
res[i] = pre;

‎backtrack/letter_combinations_of_a_phone_number/Solution.java

Lines changed: 21 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010
*/
1111
class Solution {
1212
public List<String> letterCombinations(String digits) {
13-
var combinations = new ArrayList<String>();
13+
ArrayList<String> combinations = new ArrayList<String>();
1414
if (digits.isEmpty()) {
1515
return combinations;
1616
}
@@ -30,16 +30,25 @@ private void backtrack(List<String> combinations, String digits, int p, StringBu
3030
}
3131

3232
private String[] getCharacters(char c) {
33-
return switch (c) {
34-
case '2' -> new String[]{"a", "b", "c"};
35-
case '3' -> new String[]{"d", "e", "f"};
36-
case '4' -> new String[]{"g", "h", "i"};
37-
case '5' -> new String[]{"j", "k", "l"};
38-
case '6' -> new String[]{"m", "n", "o"};
39-
case '7' -> new String[]{"p", "q", "r", "s"};
40-
case '8' -> new String[]{"t", "u", "v"};
41-
case '9' -> new String[]{"w", "x", "y", "z"};
42-
default -> new String[0];
43-
};
33+
switch (c) {
34+
case '2':
35+
return new String[]{"a", "b", "c"};
36+
case '3':
37+
return new String[]{"d", "e", "f"};
38+
case '4':
39+
return new String[]{"g", "h", "i"};
40+
case '5':
41+
return new String[]{"j", "k", "l"};
42+
case '6':
43+
return new String[]{"m", "n", "o"};
44+
case '7':
45+
return new String[]{"p", "q", "r", "s"};
46+
case '8':
47+
return new String[]{"t", "u", "v"};
48+
case '9':
49+
return new String[]{"w", "x", "y", "z"};
50+
default:
51+
return new String[0];
52+
}
4453
}
4554
}

‎backtrack/n_queens/Solution.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -9,8 +9,8 @@
99
*/
1010
class Solution {
1111
public List<List<String>> solveNQueens(int n) {
12-
var res = new ArrayList<List<String>>();
13-
var queens = new int[n];
12+
ArrayList<List<String>> res = new ArrayList<List<String>>();
13+
int[] queens = new int[n];
1414
Arrays.fill(queens, -1);
1515
backtrack(res, queens, 0, new HashSet<>(), new HashSet<>(), new HashSet<>());
1616
return res;
@@ -44,9 +44,9 @@ private void backtrack(List<List<String>> res, int[] queens, int row, Set<Intege
4444
}
4545

4646
private List<String> generateBoard(int[] queens) {
47-
var board = new ArrayList<String>(queens.length);
47+
ArrayList<String> board = new ArrayList<String>(queens.length);
4848
for (int queen : queens) {
49-
var row = new char[queens.length];
49+
char[] row = new char[queens.length];
5050
Arrays.fill(row, '.');
5151
row[queen] = 'Q';
5252
board.add(new String(row));

‎binary_search/house_robber_iv/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,8 +9,8 @@
99
*/
1010
class Solution {
1111
public int minCapability(int[] nums, int k) {
12-
var r = Arrays.stream(nums).max().getAsInt();
13-
var l = Arrays.stream(nums).min().getAsInt();
12+
int r = Arrays.stream(nums).max().getAsInt();
13+
int l = Arrays.stream(nums).min().getAsInt();
1414
while (l <= r) {
1515
int cnt = 0;
1616
int mid = (l + r) / 2;

‎binary_search/median_of_two_sorted_arrays/Solution.java

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -9,14 +9,14 @@ class Solution {
99
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
1010
int len1 = nums1.length;
1111
int len2 = nums2.length;
12-
var odd = findKth(nums1, 0, len1 - 1, nums2, 0, len2 - 1, (len1 + len2 + 1) / 2);
13-
var even = findKth(nums1, 0, len1 - 1, nums2, 0, len2 - 1, (len1 + len2 + 2) / 2);
12+
int odd = findKth(nums1, 0, len1 - 1, nums2, 0, len2 - 1, (len1 + len2 + 1) / 2);
13+
int even = findKth(nums1, 0, len1 - 1, nums2, 0, len2 - 1, (len1 + len2 + 2) / 2);
1414
return (odd + even) / 2.0;
1515
}
1616

1717
private int findKth(int[] nums1, int start1, int end1, int[] nums2, int start2, int end2, int k) {
18-
var len1 = end1 - start1 + 1;
19-
var len2 = end2 - start2 + 1;
18+
int len1 = end1 - start1 + 1;
19+
int len2 = end2 - start2 + 1;
2020
if (len1 > len2) {
2121
return findKth(nums2, start2, end2, nums1, start1, end1, k);
2222
}
@@ -26,8 +26,8 @@ private int findKth(int[] nums1, int start1, int end1, int[] nums2, int start2,
2626
if (k == 1) {
2727
return Math.min(nums1[start1], nums2[start2]);
2828
}
29-
var i = start1 + Math.min(len1, k / 2) - 1;
30-
var j = start2 + Math.min(len2, k / 2) - 1;
29+
int i = start1 + Math.min(len1, k / 2) - 1;
30+
int j = start2 + Math.min(len2, k / 2) - 1;
3131
if (nums1[i] > nums2[j]) {
3232
return findKth(nums1, start1, end1, nums2, j + 1, end2, k - (j + 1 - start2));
3333
} else {

‎binary_search/two_sum_ii_input_array_is_sorted/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,10 +10,10 @@ class Solution {
1010
// binary search O(nlogn)
1111
public int[] twoSum(int[] numbers, int target) {
1212
for (int i = 0; i < numbers.length - 1; i++) {
13-
var low = i + 1;
14-
var high = numbers.length - 1;
13+
int low = i + 1;
14+
int high = numbers.length - 1;
1515
while (low <= high) {
16-
var mid = (low + high) / 2;
16+
int mid = (low + high) / 2;
1717
if (numbers[mid] == target - numbers[i]) {
1818
return new int[]{i + 1, mid + 1};
1919
} else if (numbers[mid] < target - numbers[i]) {

‎bitwise_operation/single_number_ii/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -7,8 +7,8 @@
77
*/
88
class Solution {
99
public int singleNumber(int[] nums) {
10-
var ones = 0;
11-
var twos = 0;
10+
int ones = 0;
11+
int twos = 0;
1212
for (int num : nums) {
1313
ones = ~twos & (ones ^ num);
1414
twos = ~ones & (twos ^ num);

‎breadth_first_search/binary_tree_right_side_view/Solution.java

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -12,20 +12,20 @@
1212
*/
1313
class Solution {
1414
public List<Integer> rightSideView(TreeNode root) {
15-
var list = new ArrayList<TreeNode>();
15+
ArrayList<TreeNode> list = new ArrayList<TreeNode>();
1616
if (root != null) {
1717
list.add(root);
1818
}
19-
var res = new ArrayList<Integer>();
19+
ArrayList<Integer> res = new ArrayList<Integer>();
2020
while (!list.isEmpty()) {
2121
res.add(list.get(0).val);
22-
var temp = new ArrayList<TreeNode>();
22+
ArrayList<TreeNode> temp = new ArrayList<TreeNode>();
2323
for (TreeNode node : list) {
24-
var right = node.right;
24+
TreeNode right = node.right;
2525
if (right != null) {
2626
temp.add(right);
2727
}
28-
var left = node.left;
28+
TreeNode left = node.left;
2929
if (left != null) {
3030
temp.add(left);
3131
}

‎design/lfu_cache/LFUCache.java

Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@ class LFUCache {
1515

1616
public LFUCache(int capacity) {
1717
this.capacity = capacity;
18-
var headList = new DoubleLinkedList(Integer.MAX_VALUE);
18+
DoubleLinkedList headList = new DoubleLinkedList(Integer.MAX_VALUE);
1919
this.tailList = new DoubleLinkedList(0);
2020
headList.lessFreq = this.tailList;
2121
this.tailList.moreFreq = headList;
@@ -24,12 +24,12 @@ public LFUCache(int capacity) {
2424

2525
public int get(int key) {
2626
if (cache.containsKey(key)) {
27-
var node = cache.get(key);
28-
var list = node.doubleLinkedList;
29-
var nodeFreq = list.frequency + 1;
27+
Node node = cache.get(key);
28+
DoubleLinkedList list = node.doubleLinkedList;
29+
int nodeFreq = list.frequency + 1;
3030
list.removeNode(node);
3131
if (list.moreFreq.frequency > nodeFreq) {
32-
var newAddedList = new DoubleLinkedList(nodeFreq);
32+
DoubleLinkedList newAddedList = new DoubleLinkedList(nodeFreq);
3333
newAddedList.addNode(node);
3434
addDoubleLinkedListAt(list, newAddedList);
3535
} else {
@@ -45,14 +45,14 @@ public int get(int key) {
4545

4646
public void put(int key, int value) {
4747
if (cache.containsKey(key)) {
48-
var node = cache.get(key);
48+
Node node = cache.get(key);
4949
node.val = value;
5050
get(key);
5151
} else {
52-
var node = new Node(key, value);
53-
var leastFreqList = tailList.moreFreq;
52+
Node node = new Node(key, value);
53+
DoubleLinkedList leastFreqList = tailList.moreFreq;
5454
if (capacity == cache.size()) {
55-
var removed = leastFreqList.tail.pre;
55+
Node removed = leastFreqList.tail.pre;
5656
cache.remove(removed.key);
5757
leastFreqList.removeNode(removed);
5858
if (leastFreqList.head.next == leastFreqList.tail) {
@@ -61,7 +61,7 @@ public void put(int key, int value) {
6161
}
6262
leastFreqList = tailList.moreFreq;
6363
if (leastFreqList.frequency != 1) {
64-
var newAddedList = new DoubleLinkedList(1);
64+
DoubleLinkedList newAddedList = new DoubleLinkedList(1);
6565
newAddedList.addNode(node);
6666
addDoubleLinkedListAt(tailList, newAddedList);
6767
} else {
@@ -72,16 +72,16 @@ public void put(int key, int value) {
7272
}
7373

7474
private void addDoubleLinkedListAt(DoubleLinkedList target, DoubleLinkedList newAddedList) {
75-
var moreFreqList = target.moreFreq;
75+
DoubleLinkedList moreFreqList = target.moreFreq;
7676
moreFreqList.lessFreq = newAddedList;
7777
newAddedList.moreFreq = moreFreqList;
7878
newAddedList.lessFreq = target;
7979
target.moreFreq = newAddedList;
8080
}
8181

8282
private void removeDoubleLinkedList(DoubleLinkedList list) {
83-
var moreFreqList = list.moreFreq;
84-
var lessFreqList = list.lessFreq;
83+
DoubleLinkedList moreFreqList = list.moreFreq;
84+
DoubleLinkedList lessFreqList = list.lessFreq;
8585
moreFreqList.lessFreq = lessFreqList;
8686
lessFreqList.moreFreq = moreFreqList;
8787
}
@@ -103,16 +103,16 @@ private static class DoubleLinkedList {
103103

104104
void addNode(Node node) {
105105
node.doubleLinkedList = this;
106-
var preHead = head.next;
106+
Node preHead = head.next;
107107
preHead.pre = node;
108108
node.pre = head;
109109
head.next = node;
110110
node.next = preHead;
111111
}
112112

113113
void removeNode(Node node) {
114-
var nextNode = node.next;
115-
var preNode = node.pre;
114+
Node nextNode = node.next;
115+
Node preNode = node.pre;
116116
nextNode.pre = preNode;
117117
preNode.next = nextNode;
118118
}

‎design/lru_cache/LRUCache.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@ public LRUCache(int capacity) {
3939

4040
public int get(int key) {
4141
if (cache.containsKey(key)) {
42-
var getNode = cache.get(key);
42+
Node getNode = cache.get(key);
4343
deleteNode(getNode);
4444
insertNode(getNode);
4545
return getNode.val;
@@ -49,7 +49,7 @@ public int get(int key) {
4949

5050
public void put(int key, int value) {
5151
if (cache.containsKey(key)) {
52-
var getNode = cache.get(key);
52+
Node getNode = cache.get(key);
5353
deleteNode(getNode);
5454
insertNode(getNode);
5555
getNode.val = value;
@@ -63,7 +63,7 @@ public void put(int key, int value) {
6363

6464
private void insertNode(Node node) {
6565
cache.put(node.key, node);
66-
var preHead = this.head.pre;
66+
Node preHead = this.head.pre;
6767
preHead.next = node;
6868
node.pre = preHead;
6969
node.next = this.head;
@@ -72,7 +72,7 @@ private void insertNode(Node node) {
7272

7373
private void deleteNode(Node node) {
7474
cache.remove(node.key);
75-
var preNode = node.pre;
75+
Node preNode = node.pre;
7676
preNode.next = node.next;
7777
node.next.pre = preNode;
7878
}

‎double_pointers/find_the_index_of_the_first_occurrence_in_a_string/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
class Solution {
99
// KMP算法
1010
public int strStr(String haystack, String needle) {
11-
var next = buildNext(needle);
11+
int[] next = buildNext(needle);
1212
for (int i = 0, j = 0; i < haystack.length(); i++) {
1313
while (j > 0 && haystack.charAt(i) != needle.charAt(j)) {
1414
j = next[j - 1];
@@ -24,7 +24,7 @@ public int strStr(String haystack, String needle) {
2424
}
2525

2626
private int[] buildNext(String pattern) {
27-
var next = new int[pattern.length()];
27+
int[] next = new int[pattern.length()];
2828
for (int i = 1, j = 0; i < pattern.length(); i++) {
2929
while (j > 0 && pattern.charAt(i) != pattern.charAt(j)) {
3030
j = next[j - 1];

‎double_pointers/is_subsequence/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ public boolean isSubsequence(String s, String t) {
1010
if (s.length() > t.length()) {
1111
return false;
1212
}
13-
var i = 0;
13+
int i = 0;
1414
for (int j = 0; i < s.length() && j < t.length();) {
1515
if (s.charAt(i) == t.charAt(j)) {
1616
i++;

‎double_pointers/minimum_size_subarray_sum/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
class Solution {
99
public int minSubArrayLen(int target, int[] nums) {
1010
int minLen = Integer.MAX_VALUE;
11-
var sum = nums[0];
11+
int sum = nums[0];
1212
for (int i = 0, j = 0; ; ) {
1313
if (sum >= target) {
1414
minLen = Math.min(minLen, j - i + 1);

‎double_pointers/remove_duplicates_from_sorted_array/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
*/
88
class Solution {
99
public int removeDuplicates(int[] nums) {
10-
var p = 0;
10+
int p = 0;
1111
for (int i = 1; i < nums.length; i++) {
1212
if (nums[i] != nums[p]) {
1313
nums[++p] = nums[i];

‎double_pointers/remove_duplicates_from_sorted_array_ii/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ public int removeDuplicates(int[] nums) {
1010
if (nums.length < 3) {
1111
return nums.length;
1212
}
13-
var p = 1;
13+
int p = 1;
1414
for (int i = 2; i < nums.length; i++) {
1515
if (nums[i] != nums[p - 1]) {
1616
nums[++p] = nums[i];

‎double_pointers/remove_element/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
*/
1010
class Solution {
1111
public int removeElement(int[] nums, int val) {
12-
var last = nums.length - 1;
12+
int last = nums.length - 1;
1313
for (int i = 0; i < nums.length && i <= last; i++) {
1414
if (nums[i] == val) {
1515
nums[i--] = nums[last--];

0 commit comments

Comments
 (0)