# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#92. Reverse Linked List II
#Reverse a linked list from position m to n. Do it in one-pass.
#Note: 1 ≤ m ≤ n ≤ length of list.
#Example:
#Input: 1->2->3->4->5->NULL, m = 2, n = 4
#Output: 1->4->3->2->5->NULL
## Definition for singly-linked list.
## class ListNode(object):
##     def __init__(self, x):
##         self.val = x
##         self.next = None
#class Solution(object):
#    def reverseBetween(self, head, m, n):
#        """
#        :type head: ListNode
#        :type m: int
#        :type n: int
#        :rtype: ListNode
#        """



# Time Is Money
4cdaec9e1e07eb881006f7e05b66454990ebcbe8
# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#92. Reverse Linked List II
#Reverse a linked list from position m to n. Do it in one-pass.
#Note: 1 ≤ m ≤ n ≤ length of list.
#Example:
#Input: 1->2->3->4->5->NULL, m = 2, n = 4
#Output: 1->4->3->2->5->NULL
## Definition for singly-linked list.
## class ListNode(object):
##     def __init__(self, x):
##         self.val = x
##         self.next = None
#class Solution(object):
#    def reverseBetween(self, head, m, n):
#        """
#        :type head: ListNode
#        :type m: int
#        :type n: int
#        :rtype: ListNode
#        """



# Time Is Money