add macros to subs

Author: diguage

docs/0001-two-sum.adoc

@@ -7,7 +7,7 @@ Given an array of integers, return *indices* of the two numbers such that they a
 You may assume that each input would have *_exactly_* one solution, and you may not use the _same_ element twice.
 
 .Example:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 Given nums = [2, 7, 11, 15], target = 9,
 

docs/0002-add-two-numbers.adoc

@@ -7,7 +7,7 @@ You are given two *non-empty* linked lists representing two non-negative integer
 You may assume the two numbers do not contain any leading zero, except the number 0 itself.
 
 .Example:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *Output:* 7 -> 0 -> 8

docs/0003-longest-substring-without-repeating-characters.adoc

@@ -6,7 +6,7 @@ Given a string, find the length of the *longest substring* without repeating cha
 
 
 .Example 1:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "abcabcbb"
 *Output:* 3 
@@ -15,7 +15,7 @@ Given a string, find the length of the *longest substring* without repeating cha
 
 
 .Example 2:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "bbbbb"
 *Output:* 1
@@ -24,7 +24,7 @@ Given a string, find the length of the *longest substring* without repeating cha
 
 
 .Example 3:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "pwwkew"
 *Output:* 3

docs/0004-median-of-two-sorted-arrays.adoc

@@ -9,7 +9,7 @@ Find the median of the two sorted arrays. The overall run time complexity should
 You may assume *nums1* and *nums2* cannot be both empty.
 
 .Example 1:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 nums1 = [1, 3]
 nums2 = [2]
@@ -18,7 +18,7 @@ The median is 2.0
 ----
 
 .Example 2:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 nums1 = [1, 2]
 nums2 = [3, 4]

docs/0005-longest-palindromic-substring.adoc

@@ -5,15 +5,15 @@ https://leetcode.com/problems/longest-palindromic-substring/[LeetCode - Longest
 Given a string *s*, find the longest palindromic substring in *s*. You may assume that the maximum length of *s* is 1000.
 
 .Example 1:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "babad"
 *Output:* "bab"
 *Note:* "aba" is also a valid answer.
 ----
 
 .Example 2:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "cbbd"
 *Output:* "bb"

docs/0006-zigzag-conversion.adoc

@@ -4,7 +4,7 @@ https://leetcode.com/problems/zigzag-conversion/[LeetCode - ZigZag Conversion]
 
 The string `"PAYPALISHIRING"` is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 P   A   H   N
 A P L S I I G
@@ -15,21 +15,21 @@ And then read line by line: `"PAHNAPLSIIGYIR"`
 
 Write the code that will take a string and make this conversion given a number of rows:
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 string convert(string s, int numRows);
 ----
 
 .Example 1:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* s = "PAYPALISHIRING", numRows = 3
 *Output:* "PAHNAPLSIIGYIR"
 
 ----
 
 .Example 2:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* s = "PAYPALISHIRING", numRows = 4
 *Output:* "PINALSIGYAHRPI"

docs/0007-reverse-integer.adoc

@@ -5,21 +5,21 @@ https://leetcode.com/problems/reverse-integer/[LeetCode - Reverse Integer]
 Given a 32-bit signed integer, reverse digits of an integer.
 
 .Example 1:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 123
 *Output:* 321
 ----
 
 .Example 2:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* -123
 *Output:* -321
 ----
 
 .Example 3:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 120
 *Output:* 21

docs/0008-string-to-integer-atoi.adoc

@@ -19,14 +19,14 @@ If no valid conversion could be performed, a zero value is returned.
 
 
 .Example 1:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "42"
 *Output:* 42
 ----
 
 .Example 2:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "   -42"
 *Output:* -42
@@ -35,15 +35,15 @@ If no valid conversion could be performed, a zero value is returned.
 ----
 
 .Example 3:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "4193 with words"
 *Output:* 4193
 *Explanation:* Conversion stops at digit '3' as the next character is not a numerical digit.
 ----
 
 .Example 4:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "words and 987"
 *Output:* 0
@@ -52,7 +52,7 @@ If no valid conversion could be performed, a zero value is returned.
 ----
 
 .Example 5:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "-91283472332"
 *Output:* -2147483648

docs/0009-palindrome-number.adoc

@@ -5,22 +5,22 @@ https://leetcode.com/problems/palindrome-number/[LeetCode - Palindrome Number]
 Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
 
 .Example 1:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 121
 *Output:* true
 ----
 
 .Example 2:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* -121
 *Output:* false
 *Explanation:* From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
 ----
 
 .Example 3:
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 10
 *Output:* false

docs/0010-regular-expression-matching.adoc

@@ -4,7 +4,7 @@ https://leetcode.com/problems/regular-expression-matching/[LeetCode - Regular Ex
 
 Given an input string (`s`) and a pattern (`p`), implement regular expression matching with support for `'.'` and `'*'`.
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 '.' Matches any single character.
 '*' Matches zero or more of the preceding element.
@@ -21,7 +21,7 @@ The matching should cover the *entire* input string (not partial).
 
 *Example 1:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:*
 s = "aa"
@@ -32,7 +32,7 @@ p = "a"
 
 *Example 2:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:*
 s = "aa"
@@ -43,7 +43,7 @@ p = "a*"
 
 *Example 3:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:*
 s = "ab"
@@ -54,7 +54,7 @@ p = ".*"
 
 *Example 4:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:*
 s = "aab"
@@ -65,7 +65,7 @@ p = "c*a*b"
 
 *Example 5:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:*
 s = "mississippi"

docs/0011-container-with-most-water.adoc

@@ -16,7 +16,7 @@ image::https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg[
 
 *Example:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* [1,8,6,2,5,4,8,3,7]
 *Output:* 49

docs/0012-integer-to-roman.adoc

@@ -4,7 +4,7 @@ https://leetcode.com/problems/integer-to-roman/[LeetCode - Integer to Roman]
 
 Roman numerals are represented by seven different symbols: `I`, `V`, `X`, `L`, `C`, `D` and `M`.
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Symbol*       *Value*
 I             1
@@ -30,31 +30,31 @@ Given an integer, convert it to a roman numeral. Input is guaranteed to be withi
 
 *Example 1:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 3
 *Output:* "III"
 ----
 
 *Example 2:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 4
 *Output:* "IV"
 ----
 
 *Example 3:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 9
 *Output:* "IX"
 ----
 
 *Example 4:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 58
 *Output:* "LVIII"
@@ -63,7 +63,7 @@ Given an integer, convert it to a roman numeral. Input is guaranteed to be withi
 
 *Example 5:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* 1994
 *Output:* "MCMXCIV"

docs/0013-roman-to-integer.adoc

@@ -4,7 +4,7 @@ https://leetcode.com/problems/roman-to-integer/[LeetCode - Roman to Integer]
 
 Roman numerals are represented by seven different symbols: `I`, `V`, `X`, `L`, `C`, `D` and `M`.
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Symbol*       *Value*
 I             1
@@ -30,31 +30,31 @@ Given a roman numeral, convert it to an integer. Input is guaranteed to be withi
 
 *Example 1:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "III"
 *Output:* 3
 ----
 
 *Example 2:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "IV"
 *Output:* 4
 ----
 
 *Example 3:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "IX"
 *Output:* 9
 ----
 
 *Example 4:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "LVIII"
 *Output:* 58
@@ -64,7 +64,7 @@ Given a roman numeral, convert it to an integer. Input is guaranteed to be withi
 
 *Example 5:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* "MCMXCIV"
 *Output:* 1994

docs/0014-longest-common-prefix.adoc

@@ -8,15 +8,15 @@ If there is no common prefix, return an empty string `""`.
 
 *Example 1:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* ["flower","flow","flight"]
 *Output:* "fl"
 ----
 
 *Example 2:*
 
-[subs="verbatim,quotes"]
+[subs="verbatim,quotes,macros"]
 ----
 *Input:* ["dog","racecar","car"]
 *Output:* ""