Skip to content

Added tasks 2210, 2211, 2212, 2213, 2216 #1115

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 9 commits into from
Jun 12, 2022
Merged

Added tasks 2210, 2211, 2212, 2213, 2216 #1115

Changes from 1 commit
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
787341a
Added tasks 2210, 2211, 2212, 2213, 2216
ThanhNIT Jun 12, 2022
5a46960
fix smells
ThanhNIT Jun 12, 2022
092f046
Update Solution.java
javadev Jun 12, 2022
624e77a
Update Solution.java
javadev Jun 12, 2022
a622b0e
Update Solution.java
javadev Jun 12, 2022
a6709f8
Update Solution.java
javadev Jun 12, 2022
7447767
Update Solution.java
javadev Jun 12, 2022
27464ac
Update Solution.java
javadev Jun 12, 2022
de9b06c
Update Solution.java
javadev Jun 12, 2022
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Update Solution.java
  • Loading branch information
@javadev
javadev authored Jun 12, 2022
commit de9b06c1cd9b4a285f2b4ffe8f7625e126fa7412
2 changes: 1 addition & 1 deletion src/main/java/g2201_2300/s2210_count_hills_and_valleys_in_an_array/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
// #Easy #Array #2022_06_12_Time_0_ms_(100.00%)_Space_41.8_MB_(60.16%)

public class Solution {
public int countHillValley(int[] nums) {
public int countHillValley(int[] nums) {
int left = nums[0];
int count = 0;
for (int i = 1; i < nums.length - 1; i++) {
Expand Down