Count the Rises
Count the nodes whose value is strictly greater than the value of the node just before them. The head has no node before it, so it never counts. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,3,2,2,5]
returns 2
3 and 5 are bigger than the node before them.
Example 2
head [4,4,4]
returns 0
Equal is not a rise.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Differences of NeighborsBeginner
- Everything After a ValueBeginner
- Find a Value's IndexBeginner
- First Index of the Largest ValueBeginner
- Get the Kth ValueBeginner
- Is It a PrefixBeginner
- Is the List SortedBeginner
- Kth Smallest ValueBeginner