Skip to content

Commit be3e15d

Browse files
mengxinayanmengxinayan
committed
Update Copyright year
1 parent 1d110ea commit be3e15d

File tree

569 files changed

+569
-569
lines changed

Some content is hidden

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

569 files changed

+569
-569
lines changed

‎algorithm/java/101_symmetric_tree.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,7 @@ public boolean isSymmetricTwoNode(TreeNode left, TreeNode right) {
3636
/**
3737
* This is my personal record of solving Leetcode Problems.
3838
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
39-
* Copyright (C) 2020-2021 mengxinayan
39+
* Copyright (C) 2020-2022 mengxinayan
4040
*
4141
* This program is free software: you can redistribute it and/or modify
4242
* it under the terms of the GNU General Public License as published by

‎algorithm/java/102_binary_tree_level_order_traversal.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -74,7 +74,7 @@ public List<List<Integer>> levelOrder(TreeNode root) {
7474
/**
7575
* This is my personal record of solving Leetcode Problems.
7676
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
77-
* Copyright (C) 2020-2021 mengxinayan
77+
* Copyright (C) 2020-2022 mengxinayan
7878
*
7979
* This program is free software: you can redistribute it and/or modify
8080
* it under the terms of the GNU General Public License as published by

‎algorithm/java/103_binary_tree_zigzag_level_order_traversal.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -45,7 +45,7 @@ public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
4545
/**
4646
* This is my personal record of solving Leetcode Problems.
4747
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
48-
* Copyright (C) 2020-2021 mengxinayan
48+
* Copyright (C) 2020-2022 mengxinayan
4949
*
5050
* This program is free software: you can redistribute it and/or modify
5151
* it under the terms of the GNU General Public License as published by

‎algorithm/java/104_maximum_depth_of_binary_tree.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ public int maxDepth(TreeNode root) {
2525
/**
2626
* This is my personal record of solving Leetcode Problems.
2727
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
28-
* Copyright (C) 2020-2021 mengxinayan
28+
* Copyright (C) 2020-2022 mengxinayan
2929
*
3030
* This program is free software: you can redistribute it and/or modify
3131
* it under the terms of the GNU General Public License as published by

‎algorithm/java/105_construct_binary_tree_from_preorder_and_inorder_traversal.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -46,7 +46,7 @@ public TreeNode realBuildTree(int[] preorder, int pre_left, int pre_right,
4646
/**
4747
* This is my personal record of solving Leetcode Problems.
4848
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
49-
* Copyright (C) 2020-2021 mengxinayan
49+
* Copyright (C) 2020-2022 mengxinayan
5050
*
5151
* This program is free software: you can redistribute it and/or modify
5252
* it under the terms of the GNU General Public License as published by

‎algorithm/java/108_convert_sorted_array_to_binary_search_tree.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@ static TreeNode arrayToBST(int[] nums, int left, int right) {
3737
/**
3838
* This is my personal record of solving Leetcode Problems.
3939
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
40-
* Copyright (C) 2020-2021 mengxinayan
40+
* Copyright (C) 2020-2022 mengxinayan
4141
*
4242
* This program is free software: you can redistribute it and/or modify
4343
* it under the terms of the GNU General Public License as published by

‎algorithm/java/116_populating_next_right_pointers_in_each_node.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -80,7 +80,7 @@ public Node connect(Node root) {
8080
/**
8181
* This is my personal record of solving Leetcode Problems.
8282
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
83-
* Copyright (C) 2020-2021 mengxinayan
83+
* Copyright (C) 2020-2022 mengxinayan
8484
*
8585
* This program is free software: you can redistribute it and/or modify
8686
* it under the terms of the GNU General Public License as published by

‎algorithm/java/118_pascal's_triangle.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ public List<List<Integer>> generate(int numRows) {
2727
/**
2828
* This is my personal record of solving Leetcode Problems.
2929
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
30-
* Copyright (C) 2020-2021 mengxinayan
30+
* Copyright (C) 2020-2022 mengxinayan
3131
*
3232
* This program is free software: you can redistribute it and/or modify
3333
* it under the terms of the GNU General Public License as published by

‎algorithm/java/122_best_time_to_buy_and_sell_stock_II.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ public int maxProfit(int[] prices) {
2121
/**
2222
* This is my personal record of solving Leetcode Problems.
2323
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
24-
* Copyright (C) 2020-2021 mengxinayan
24+
* Copyright (C) 2020-2022 mengxinayan
2525
*
2626
* This program is free software: you can redistribute it and/or modify
2727
* it under the terms of the GNU General Public License as published by

‎algorithm/java/125_valid_palindrome.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ public boolean isPalindrome(String s) {
2828
/**
2929
* This is my personal record of solving Leetcode Problems.
3030
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
31-
* Copyright (C) 2020-2021 mengxinayan
31+
* Copyright (C) 2020-2022 mengxinayan
3232
*
3333
* This program is free software: you can redistribute it and/or modify
3434
* it under the terms of the GNU General Public License as published by

‎algorithm/java/136_single_number.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ public int singleNumber(int[] nums) {
1111
/**
1212
* This is my personal record of solving Leetcode Problems.
1313
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
14-
* Copyright (C) 2020-2021 mengxinayan
14+
* Copyright (C) 2020-2022 mengxinayan
1515
*
1616
* This program is free software: you can redistribute it and/or modify
1717
* it under the terms of the GNU General Public License as published by

‎algorithm/java/13_roman_to_integer.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -67,7 +67,7 @@ public int romanToInt(String s) {
6767
/**
6868
* This is my personal record of solving Leetcode Problems.
6969
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
70-
* Copyright (C) 2020-2021 mengxinayan
70+
* Copyright (C) 2020-2022 mengxinayan
7171
*
7272
* This program is free software: you can redistribute it and/or modify
7373
* it under the terms of the GNU General Public License as published by

‎algorithm/java/141_linked_list_cycle.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@ public boolean hasCycle(ListNode head) {
3232
/**
3333
* This is my personal record of solving Leetcode Problems.
3434
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
35-
* Copyright (C) 2020-2021 mengxinayan
35+
* Copyright (C) 2020-2022 mengxinayan
3636
*
3737
* This program is free software: you can redistribute it and/or modify
3838
* it under the terms of the GNU General Public License as published by

‎algorithm/java/14_longest_common_prefix.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ static public String commonPrefix(String str1, String str2) {
2727
/**
2828
* This is my personal record of solving Leetcode Problems.
2929
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
30-
* Copyright (C) 2020-2021 mengxinayan
30+
* Copyright (C) 2020-2022 mengxinayan
3131
*
3232
* This program is free software: you can redistribute it and/or modify
3333
* it under the terms of the GNU General Public License as published by

‎algorithm/java/155_min_stack.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -47,7 +47,7 @@ public int getMin() {
4747
/**
4848
* This is my personal record of solving Leetcode Problems.
4949
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
50-
* Copyright (C) 2020-2021 mengxinayan
50+
* Copyright (C) 2020-2022 mengxinayan
5151
*
5252
* This program is free software: you can redistribute it and/or modify
5353
* it under the terms of the GNU General Public License as published by

‎algorithm/java/15_3sum.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -74,7 +74,7 @@ public List<List<Integer>> threeSum(int[] nums) {
7474
/**
7575
* This is my personal record of solving Leetcode Problems.
7676
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
77-
* Copyright (C) 2020-2021 mengxinayan
77+
* Copyright (C) 2020-2022 mengxinayan
7878
*
7979
* This program is free software: you can redistribute it and/or modify
8080
* it under the terms of the GNU General Public License as published by

‎algorithm/java/160_intersection_of_two_linked_lists.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -51,7 +51,7 @@ public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
5151
/**
5252
* This is my personal record of solving Leetcode Problems.
5353
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
54-
* Copyright (C) 2020-2021 mengxinayan
54+
* Copyright (C) 2020-2022 mengxinayan
5555
*
5656
* This program is free software: you can redistribute it and/or modify
5757
* it under the terms of the GNU General Public License as published by

‎algorithm/java/162_find_peak_element.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -46,7 +46,7 @@ public int binarySearchPeak(float[] arr, int left, int right) {
4646
/**
4747
* This is my personal record of solving Leetcode Problems.
4848
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
49-
* Copyright (C) 2020-2021 mengxinayan
49+
* Copyright (C) 2020-2022 mengxinayan
5050
*
5151
* This program is free software: you can redistribute it and/or modify
5252
* it under the terms of the GNU General Public License as published by

‎algorithm/java/169_majority_element.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -33,7 +33,7 @@ public int majorityElement(int[] nums) {
3333
/**
3434
* This is my personal record of solving Leetcode Problems.
3535
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
36-
* Copyright (C) 2020-2021 mengxinayan
36+
* Copyright (C) 2020-2022 mengxinayan
3737
*
3838
* This program is free software: you can redistribute it and/or modify
3939
* it under the terms of the GNU General Public License as published by

‎algorithm/java/171_excel_sheet_column_number.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ public int titleToNumber(String columnTitle) {
1212
/**
1313
* This is my personal record of solving Leetcode Problems.
1414
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
15-
* Copyright (C) 2020-2021 mengxinayan
15+
* Copyright (C) 2020-2022 mengxinayan
1616
*
1717
* This program is free software: you can redistribute it and/or modify
1818
* it under the terms of the GNU General Public License as published by

‎algorithm/java/172_factorial_trailing_zeroes.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ public int countFive(int n) {
2020
/**
2121
* This is my personal record of solving Leetcode Problems.
2222
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
23-
* Copyright (C) 2020-2021 mengxinayan
23+
* Copyright (C) 2020-2022 mengxinayan
2424
*
2525
* This program is free software: you can redistribute it and/or modify
2626
* it under the terms of the GNU General Public License as published by

‎algorithm/java/17_letter_combinations_of_a_phone_number.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,7 @@ public void backtracing(StringBuilder sb, List<String> ans, int index, String di
3636
/**
3737
* This is my personal record of solving Leetcode Problems.
3838
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
39-
* Copyright (C) 2020-2021 mengxinayan
39+
* Copyright (C) 2020-2022 mengxinayan
4040
*
4141
* This program is free software: you can redistribute it and/or modify
4242
* it under the terms of the GNU General Public License as published by

‎algorithm/java/189_rotate_array.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,7 @@ public void rotate(int[] nums, int k) {
6060
/**
6161
* This is my personal record of solving Leetcode Problems.
6262
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
63-
* Copyright (C) 2020-2021 mengxinayan
63+
* Copyright (C) 2020-2022 mengxinayan
6464
*
6565
* This program is free software: you can redistribute it and/or modify
6666
* it under the terms of the GNU General Public License as published by

‎algorithm/java/190_reverse_bits.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ public int reverseBits(int n) {
2020
/**
2121
* This is my personal record of solving Leetcode Problems.
2222
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
23-
* Copyright (C) 2020-2021 mengxinayan
23+
* Copyright (C) 2020-2022 mengxinayan
2424
*
2525
* This program is free software: you can redistribute it and/or modify
2626
* it under the terms of the GNU General Public License as published by

‎algorithm/java/191_number_of_1_bits.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@ public int hammingWeight(int n) {
1515
/**
1616
* This is my personal record of solving Leetcode Problems.
1717
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
18-
* Copyright (C) 2020-2021 mengxinayan
18+
* Copyright (C) 2020-2022 mengxinayan
1919
*
2020
* This program is free software: you can redistribute it and/or modify
2121
* it under the terms of the GNU General Public License as published by

‎algorithm/java/198_house_robber.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ public int rob(int[] nums) {
1919
/**
2020
* This is my personal record of solving Leetcode Problems.
2121
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
22-
* Copyright (C) 2020-2021 mengxinayan
22+
* Copyright (C) 2020-2022 mengxinayan
2323
*
2424
* This program is free software: you can redistribute it and/or modify
2525
* it under the terms of the GNU General Public License as published by

‎algorithm/java/19_remove_Nth_node_from_end_of_list.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -53,7 +53,7 @@ public ListNode removeNthFromEnd(ListNode head, int n) {
5353
/**
5454
* This is my personal record of solving Leetcode Problems.
5555
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
56-
* Copyright (C) 2020-2021 mengxinayan
56+
* Copyright (C) 2020-2022 mengxinayan
5757
*
5858
* This program is free software: you can redistribute it and/or modify
5959
* it under the terms of the GNU General Public License as published by

‎algorithm/java/1_two_sum.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -57,7 +57,7 @@ public int[] twoSum(int[] nums, int target) {
5757
/**
5858
* This is my personal record of solving Leetcode Problems.
5959
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
60-
* Copyright (C) 2020-2021 mengxinayan
60+
* Copyright (C) 2020-2022 mengxinayan
6161
*
6262
* This program is free software: you can redistribute it and/or modify
6363
* it under the terms of the GNU General Public License as published by

‎algorithm/java/200_number_of_islands.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -72,7 +72,7 @@ public void dfs(int row, int col, char[][] grid) {
7272
/**
7373
* This is my personal record of solving Leetcode Problems.
7474
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
75-
* Copyright (C) 2020-2021 mengxinayan
75+
* Copyright (C) 2020-2022 mengxinayan
7676
*
7777
* This program is free software: you can redistribute it and/or modify
7878
* it under the terms of the GNU General Public License as published by

‎algorithm/java/202_happy_number.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -29,7 +29,7 @@ public int cal(int n) {
2929
/**
3030
* This is my personal record of solving Leetcode Problems.
3131
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
32-
* Copyright (C) 2020-2021 mengxinayan
32+
* Copyright (C) 2020-2022 mengxinayan
3333
*
3434
* This program is free software: you can redistribute it and/or modify
3535
* it under the terms of the GNU General Public License as published by

‎algorithm/java/204_count_primes.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -29,7 +29,7 @@ public int countPrimes(int n) {
2929
/**
3030
* This is my personal record of solving Leetcode Problems.
3131
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
32-
* Copyright (C) 2020-2021 mengxinayan
32+
* Copyright (C) 2020-2022 mengxinayan
3333
*
3434
* This program is free software: you can redistribute it and/or modify
3535
* it under the terms of the GNU General Public License as published by

‎algorithm/java/206_reverse_linked_list.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ public ListNode reverseList(ListNode head) {
2828
/**
2929
* This is my personal record of solving Leetcode Problems.
3030
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
31-
* Copyright (C) 2020-2021 mengxinayan
31+
* Copyright (C) 2020-2022 mengxinayan
3232
*
3333
* This program is free software: you can redistribute it and/or modify
3434
* it under the terms of the GNU General Public License as published by

‎algorithm/java/20_valid_parentheses.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@ public boolean isValid(String s) {
3939
/**
4040
* This is my personal record of solving Leetcode Problems.
4141
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
42-
* Copyright (C) 2020-2021 mengxinayan
42+
* Copyright (C) 2020-2022 mengxinayan
4343
*
4444
* This program is free software: you can redistribute it and/or modify
4545
* it under the terms of the GNU General Public License as published by

‎algorithm/java/215_Kth_largest_element_in_an_array.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ public int findKthLargest(int[] nums, int k) {
1818
/**
1919
* This is my personal record of solving Leetcode Problems.
2020
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
21-
* Copyright (C) 2020-2021 mengxinayan
21+
* Copyright (C) 2020-2022 mengxinayan
2222
*
2323
* This program is free software: you can redistribute it and/or modify
2424
* it under the terms of the GNU General Public License as published by

‎algorithm/java/217_contains_duplicate.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@ public boolean containsDuplicate(int[] nums) {
1717
/**
1818
* This is my personal record of solving Leetcode Problems.
1919
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
20-
* Copyright (C) 2020-2021 mengxinayan
20+
* Copyright (C) 2020-2022 mengxinayan
2121
*
2222
* This program is free software: you can redistribute it and/or modify
2323
* it under the terms of the GNU General Public License as published by

‎algorithm/java/21_merge_two_sorted_lists.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -51,7 +51,7 @@ public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
5151
/**
5252
* This is my personal record of solving Leetcode Problems.
5353
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
54-
* Copyright (C) 2020-2021 mengxinayan
54+
* Copyright (C) 2020-2022 mengxinayan
5555
*
5656
* This program is free software: you can redistribute it and/or modify
5757
* it under the terms of the GNU General Public License as published by

‎algorithm/java/22_generate_parentheses.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@ public void backtracking(StringBuilder sb, int left, int right, int n, List<Stri
2626
/**
2727
* This is my personal record of solving Leetcode Problems.
2828
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
29-
* Copyright (C) 2020-2021 mengxinayan
29+
* Copyright (C) 2020-2022 mengxinayan
3030
*
3131
* This program is free software: you can redistribute it and/or modify
3232
* it under the terms of the GNU General Public License as published by

‎algorithm/java/230_Kth_smallest_element_in_a_BST.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@ public void inOrderTraversal(List<Integer> arr, TreeNode root) {
3232
/**
3333
* This is my personal record of solving Leetcode Problems.
3434
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
35-
* Copyright (C) 2020-2021 mengxinayan
35+
* Copyright (C) 2020-2022 mengxinayan
3636
*
3737
* This program is free software: you can redistribute it and/or modify
3838
* it under the terms of the GNU General Public License as published by

‎algorithm/java/234_palindrome_linked_list.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -73,7 +73,7 @@ private ListNode reverseListNode(ListNode head) {
7373
/**
7474
* This is my personal record of solving Leetcode Problems.
7575
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
76-
* Copyright (C) 2020-2021 mengxinayan
76+
* Copyright (C) 2020-2022 mengxinayan
7777
*
7878
* This program is free software: you can redistribute it and/or modify
7979
* it under the terms of the GNU General Public License as published by

‎algorithm/java/237_delete_node_in_a_linked_list.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ public void deleteNode(ListNode node) {
1616
/**
1717
* This is my personal record of solving Leetcode Problems.
1818
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
19-
* Copyright (C) 2020-2021 mengxinayan
19+
* Copyright (C) 2020-2022 mengxinayan
2020
*
2121
* This program is free software: you can redistribute it and/or modify
2222
* it under the terms of the GNU General Public License as published by

‎algorithm/java/240_search_a_2D_matrix_II.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,7 @@ public boolean searchMatrix(int[][] matrix, int target) {
3434
/**
3535
* This is my personal record of solving Leetcode Problems.
3636
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
37-
* Copyright (C) 2020-2021 mengxinayan
37+
* Copyright (C) 2020-2022 mengxinayan
3838
*
3939
* This program is free software: you can redistribute it and/or modify
4040
* it under the terms of the GNU General Public License as published by

‎algorithm/java/242_valid_anagram.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ public boolean isAnagram(String s, String t) {
2222
/**
2323
* This is my personal record of solving Leetcode Problems.
2424
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
25-
* Copyright (C) 2020-2021 mengxinayan
25+
* Copyright (C) 2020-2022 mengxinayan
2626
*
2727
* This program is free software: you can redistribute it and/or modify
2828
* it under the terms of the GNU General Public License as published by

0 commit comments

Comments
 (0)