Format docstrings

Author: varvarvarvar

problems/problem_0002.py

@@ -7,7 +7,6 @@
 
 You may assume the two numbers do not contain any leading zero,
 except the number 0 itself.
-
 """
 
 

problems/problem_0011.py

@@ -1,18 +1,17 @@
-from typing import List
-
+"""Given n non-negative integers a1, a2, ..., an,
+where each represents a point at coordinate (i, ai),
+n vertical lines are drawn
+such that the two endpoints of line i is at (i, ai)
+and (i, 0).
 
-class Solution:
-    """Given n non-negative integers a1, a2, ..., an,
-    where each represents a point at coordinate (i, ai),
-    n vertical lines are drawn
-    such that the two endpoints of line i is at (i, ai)
-    and (i, 0).
+Find two lines, which together with x-axis forms a container,
+such that the container contains the most water.
+"""
 
-    Find two lines, which together with x-axis forms a container,
-    such that the container contains the most water.
+from typing import List
 
-    """
 
+class Solution:
     def maxArea(self, height: List[int]) -> int:
 
         idx0, idx1 = 0, len(height) - 1

problems/problem_0013.py

@@ -1,5 +1,6 @@
 """Given a roman numeral, convert it to an integer.
-Input is guaranteed to be within the range from 1 to 3999."""
+Input is guaranteed to be within the range from 1 to 3999.
+"""
 
 
 class Solution:

problems/problem_0015.py

@@ -1,14 +1,14 @@
-from typing import List
+"""Given an array nums of n integers,
+are there elements a, b, c in nums such that a + b + c = 0?
 
+Find all unique triplets in the array which gives the sum of zero.
+Notice that the solution set must not contain duplicate triplets.
+"""
 
-class Solution:
-    """Given an array nums of n integers,
-    are there elements a, b, c in nums such that a + b + c = 0?
+from typing import List
 
-    Find all unique triplets in the array which gives the sum of zero.
-    Notice that the solution set must not contain duplicate triplets.
-    """
 
+class Solution:
     def threeSum(self, nums: List[int]) -> List[List[int]]:
 
         nums = sorted(nums)

problems/problem_0026.py

@@ -4,7 +4,8 @@
 Do not allocate extra space for another array, you must do this
 by modifying the input array in-place with O(1) extra memory.
 
-It doesn't matter what you leave beyond the returned length."""
+It doesn't matter what you leave beyond the returned length.
+"""
 
 
 class Solution:

problems/problem_0027.py

@@ -5,7 +5,8 @@
 you must do this by modifying the input array in-place with O(1) extra memory.
 
 The order of elements can be changed.
-It doesn't matter what you leave beyond the new length."""
+It doesn't matter what you leave beyond the new length.
+"""
 
 
 class Solution:

problems/problem_0028.py

@@ -2,7 +2,6 @@
 or -1 if needle is not part of haystack.
 
 For the purpose of this problem, we will return 0 when needle is an empty string.
-
 """
 
 

problems/problem_0075.py

@@ -1,5 +1,4 @@
-"""
-Given an array with n objects colored red, white or blue,
+"""Given an array with n objects colored red, white or blue,
 sort them so that objects of the same color are adjacent,
 with the colors in the order red, white and blue.
 

problems/problem_0198.py

@@ -1,21 +1,21 @@
+"""You are a professional robber planning to rob houses along a street.
+Each house has a certain amount of money stashed,
+the only constraint stopping you from robbing each of them
+is that adjacent houses have security system connected and
+it will automatically contact the police
+if two adjacent houses were broken into
+on the same night.
+
+Given a list of non-negative integers
+representing the amount of money of each house,
+determine the maximum amount of money you can rob tonight
+without alerting the police.
+"""
+
 from typing import List
 
 
 class Solution:
-    """You are a professional robber planning to rob houses along a street.
-    Each house has a certain amount of money stashed,
-    the only constraint stopping you from robbing each of them
-    is that adjacent houses have security system connected and
-    it will automatically contact the police
-    if two adjacent houses were broken into
-    on the same night.
-
-    Given a list of non-negative integers
-    representing the amount of money of each house,
-    determine the maximum amount of money you can rob tonight
-    without alerting the police.
-    """
-
     def rob(self, nums: List[int]) -> int:
 
         rob0, rob1 = 0, 0

problems/problem_0442.py

@@ -1,5 +1,4 @@
-"""
-Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array),
+"""Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array),
 some elements appear twice and others appear once.
 
 Find all the elements that appear twice in this array.

problems/problem_0500.py

@@ -1,5 +1,6 @@
 """Given a List of words, return the words that can be typed using letters of alphabet
-on only one row's of American keyboard like the image below."""
+on only one row's of American keyboard like the image below.
+"""
 
 
 class Solution:

problems/problem_0513.py

@@ -1,5 +1,4 @@
-"""
-Given a binary tree, find the leftmost value in the last row of the tree.
+"""Given a binary tree, find the leftmost value in the last row of the tree.
 
 Example 1:
 Input:

problems/problem_0515.py

@@ -1,5 +1,4 @@
-"""
-You need to find the largest value in each row of a binary tree.
+"""You need to find the largest value in each row of a binary tree.
 
 Example:
 Input:

problems/problem_0654.py

@@ -1,5 +1,4 @@
-"""
-Given an integer array with no duplicates.
+"""Given an integer array with no duplicates.
 
 A maximum tree building on this array is defined as follows:
 

problems/problem_0657.py

@@ -1,5 +1,4 @@
-"""
-Initially, there is a Robot at position (0, 0). Given a sequence of its moves,
+"""Initially, there is a Robot at position (0, 0). Given a sequence of its moves,
 judge if this robot makes a circle, which means it moves back to the original place.
 
 The move sequence is represented by a string. And each move is represent by a character.

problems/problem_0674.py

@@ -1,5 +1,4 @@
-"""
-Given an unsorted array of integers, find the length of longest continuous
+"""Given an unsorted array of integers, find the length of longest continuous
 increasing subsequence (subarray).
 
 Example 1: