about | help | code help+videos | done | prefs |
public boolean inConsecutiveAscendingOrder2(int[] nums)
public boolean inConsecutiveAscendingOrder2(int[] nums) { boolean inorder = false; if (nums[0] + 1 == nums[1]) { inorder = true; } return inorder; } inConsecutiveAscendingOrder2([1, 2]) → true inConsecutiveAscendingOrder2([1, 3]) → false inConsecutiveAscendingOrder2([1, 1]) → false ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 1
Copyright Nick Parlante 2017 - privacy