Update for swift 3.0

wty21cn · wty21cn · commit 7235f243a799 · 2016-11-08T16:25:48.000+08:00
diff --git a/leetcode-swift.xcodeproj/project.pbxproj b/leetcode-swift.xcodeproj/project.pbxproj
@@ -236,16 +236,19 @@
 				B76B78591D2A2DBE0093657C /* q007-reverse-integer.swift */,
 				B76B78571D2A24630093657C /* q009-palindrome-number.swift */,
 				B76B77E51D281C7C0093657C /* q013-roman-to-integer.swift */,
+				B7E9B29F1D2EA75500D78ECC /* q014-longest-common-prefix.swift */,
 				B7B3207C1D2BAA5C004920E2 /* q019-remove-nth-node-from-end-of-list.swift */,
 				B7B320811D2BC6B0004920E2 /* q020-valid-parentheses.swift */,
 				B76B77E61D281C7C0093657C /* q021-merge-two-sorted-lists.swift */,
 				B76B77E71D281C7C0093657C /* q024-swap-nodes-in-pairs.swift */,
 				B76B78511D2A0B2A0093657C /* q026-remove-duplicates-from-sorted-array.swift */,
 				B76B78451D294D910093657C /* q027-remove-element.swift */,
+				B7E9B2A31D2F4B1E00D78ECC /* q028-implement-strstr.swift */,
 				B76B785E1D2A5C330093657C /* q036-valid-sudoku.swift */,
 				B7E9B2951D2CB1A200D78ECC /* q038-count-and-say.swift */,
 				B7E9B2971D2CC3D600D78ECC /* q058-length-of-last-word.swift */,
 				B76B78491D2974370093657C /* q066-plus-one.swift */,
+				B7E9B2A11D2EAEA900D78ECC /* q067-add-binary.swift */,
 				B76B77E81D281C7C0093657C /* q070-climbing-stairs.swift */,
 				B76B77E91D281C7C0093657C /* q083-remove-duplicates-from-sorted-list.swift */,
 				B7B320781D2B8A77004920E2 /* q088-merge-sorted-array.swift */,
@@ -265,11 +268,13 @@
 				B76B77EE1D281C7C0093657C /* q160-majority-element.swift */,
 				B76B77EF1D281C7C0093657C /* q171-excel-sheet-column-number.swift */,
 				B76B78531D2A0EB00093657C /* q172-factorial-trailing-zeroes.swift */,
+				B7E9B29B1D2CE93D00D78ECC /* q190-reverse-bits.swift */,
 				B76B77F01D281C7C0093657C /* q191-number-of-1-bits.py */,
 				B76B77F11D281C7C0093657C /* q191-number-of-1-bits.swift */,
 				B76B78371D28B3A90093657C /* q198-house-robber.swift */,
 				B76B77F21D281C7C0093657C /* q202-happy-number.swift */,
 				B7E9B2991D2CD6DD00D78ECC /* q203-remove-linked-list-elements.swift */,
+				B70C2AAF1D30E810002AC496 /* q204-count-primes.swift */,
 				B7B320761D2B6DD0004920E2 /* q205-isomorphic-strings.swift */,
 				B76B77F31D281C7C0093657C /* q206-reverse-linked-list.swift */,
 				B76B77F41D281C7C0093657C /* q217-contains-duplicate.swift */,
@@ -279,6 +284,7 @@
 				B76B77F51D281C7C0093657C /* q226-invert-binary-tree.swift */,
 				B76B77F61D281C7C0093657C /* q231-power-of-two.swift */,
 				B76B784D1D2A017F0093657C /* q232-implement-queue-using-stacks.swift */,
+				B7E9B29D1D2E5C4600D78ECC /* q234-palindrome-linked-list.swift */,
 				B76B77F71D281C7C0093657C /* q235-lowest-common-ancestor-of-a-binary-search-tree.py */,
 				B76B77F81D281C7C0093657C /* q235-lowest-common-ancestor-of-a-binary-search-tree.swift */,
 				B76B77F91D281C7C0093657C /* q237-delete-node-in-a-linked-list.py */,
@@ -291,20 +297,14 @@
 				B7B3207E1D2BB75E004920E2 /* q290-word-pattern.swift */,
 				B76B77FF1D281C7C0093657C /* q292-nim-games.swift */,
 				B7B320701D2A8EA6004920E2 /* q299-bulls-and-cows.swift */,
+				B72E3A901D2FC2AF003595EE /* q303-range-sum-query-immutable.swift */,
 				B76B78001D281C7C0093657C /* q326-power-of-three.swift */,
 				B76B78011D281C7C0093657C /* q334-reverse-string.swift */,
 				B76B78431D29323D0093657C /* q342-power-of-four.swift */,
 				B76B78021D281C7C0093657C /* q345-reverse-vowels-of-a-string.swift */,
 				B76B78031D281C7C0093657C /* q349-Intersection-of-two-arrays.swift */,
 				B76B78041D281C7C0093657C /* q350-intersection-of-two-arrays-ii.swift */,
 				B76B78051D281C7C0093657C /* q371-sum-of-two-integers.swift */,
-				B7E9B29B1D2CE93D00D78ECC /* q190-reverse-bits.swift */,
-				B7E9B29D1D2E5C4600D78ECC /* q234-palindrome-linked-list.swift */,
-				B7E9B29F1D2EA75500D78ECC /* q014-longest-common-prefix.swift */,
-				B7E9B2A11D2EAEA900D78ECC /* q067-add-binary.swift */,
-				B7E9B2A31D2F4B1E00D78ECC /* q028-implement-strstr.swift */,
-				B72E3A901D2FC2AF003595EE /* q303-range-sum-query-immutable.swift */,
-				B70C2AAF1D30E810002AC496 /* q204-count-primes.swift */,
 			);
 			path = Easy;
 			sourceTree = "<group>";
@@ -374,7 +374,7 @@
 			isa = PBXProject;
 			attributes = {
 				LastSwiftUpdateCheck = 0730;
-				LastUpgradeCheck = 0730;
+				LastUpgradeCheck = 0810;
 				ORGANIZATIONNAME = "Rain Wang";
 				TargetAttributes = {
 					B76B77D61D281C190093657C = {
@@ -503,8 +503,10 @@
 				CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;
 				CLANG_WARN_EMPTY_BODY = YES;
 				CLANG_WARN_ENUM_CONVERSION = YES;
+				CLANG_WARN_INFINITE_RECURSION = YES;
 				CLANG_WARN_INT_CONVERSION = YES;
 				CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;
+				CLANG_WARN_SUSPICIOUS_MOVE = YES;
 				CLANG_WARN_UNREACHABLE_CODE = YES;
 				CLANG_WARN__DUPLICATE_METHOD_MATCH = YES;
 				CODE_SIGN_IDENTITY = "-";
@@ -548,8 +550,10 @@
 				CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;
 				CLANG_WARN_EMPTY_BODY = YES;
 				CLANG_WARN_ENUM_CONVERSION = YES;
+				CLANG_WARN_INFINITE_RECURSION = YES;
 				CLANG_WARN_INT_CONVERSION = YES;
 				CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;
+				CLANG_WARN_SUSPICIOUS_MOVE = YES;
 				CLANG_WARN_UNREACHABLE_CODE = YES;
 				CLANG_WARN__DUPLICATE_METHOD_MATCH = YES;
 				CODE_SIGN_IDENTITY = "-";
@@ -568,6 +572,7 @@
 				MACOSX_DEPLOYMENT_TARGET = 10.11;
 				MTL_ENABLE_DEBUG_INFO = NO;
 				SDKROOT = macosx;
+				SWIFT_OPTIMIZATION_LEVEL = "-Owholemodule";
 			};
 			name = Release;
 		};
diff --git a/leetcode-swift.xcodeproj/xcuserdata/Rain.xcuserdatad/xcschemes/leetcode-swift.xcscheme b/leetcode-swift.xcodeproj/xcuserdata/Rain.xcuserdatad/xcschemes/leetcode-swift.xcscheme
@@ -1,6 +1,6 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <Scheme
-   LastUpgradeVersion = "0730"
+   LastUpgradeVersion = "0810"
    version = "1.3">
    <BuildAction
       parallelizeBuildables = "YES"
diff --git a/leetcode-swift/Easy/q013-roman-to-integer.swift b/leetcode-swift/Easy/q013-roman-to-integer.swift
@@ -67,21 +67,21 @@ struct q13 {
             var index = reversedChars.startIndex
             while index != reversedChars.endIndex {
                 let char1 = reversedChars[index]
-                if index.successor() == reversedChars.endIndex {
+                if reversedChars.index(after: index) == reversedChars.endIndex {
                     integer += romanUnit[char1]!
                     break
                 }
-                let char2 = reversedChars[index.successor()]
+                let char2 = reversedChars[reversedChars.index(after: index)]
                 
                 if romanUnit[char1] > romanUnit[char2] && ["I", "C", "X"].contains(String(char2)) {
                     
                     integer = integer + romanUnit[char1]! - romanUnit[char2]!
-                    index = index.successor().successor()
+                    index = reversedChars.index(index, offsetBy: 2)
                     
                 } else  {
                     
                     integer += romanUnit[char1]!
-                    index = index.successor()
+                    index = reversedChars.index(after: index)
                     
                 }
             }
diff --git a/leetcode-swift/Easy/q014-longest-common-prefix.swift b/leetcode-swift/Easy/q014-longest-common-prefix.swift
@@ -35,11 +35,11 @@ struct q14 {
             }
             
             if var s = s {
-                var subrange = s.characters.indices
+                var endIndex = s.endIndex
                 for str in strs {
                     while !s.isEmpty && !str.hasPrefix(s) {
-                        subrange.upperBound = <#T##Collection corresponding to your index##Collection#>.index(before: subrange.upperBound)
-                        s = s[subrange]
+                        endIndex = s.index(before: endIndex)
+                        s = s.substring(to: endIndex)
                     }
                 }
                 return s
@@ -50,6 +50,6 @@ struct q14 {
     }
     
     static func getSolution() -> Void {
-        print(Solution().longestCommonPrefix(["ab","ac","abc","abcd"]))
+        print(Solution().longestCommonPrefix(["ab","ab","abc","abcd"]))
     }
 }
diff --git a/leetcode-swift/Easy/q019-remove-nth-node-from-end-of-list.swift b/leetcode-swift/Easy/q019-remove-nth-node-from-end-of-list.swift
@@ -55,6 +55,6 @@ struct q19 {
     
     static func getSolution() -> Void {
         let head = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,4,5,6,7])
-        print(Solution().removeNthFromEnd(head, 1))
+        print(Solution().removeNthFromEnd(head, 1) ?? "")
     }
 }
diff --git a/leetcode-swift/Easy/q021-merge-two-sorted-lists.swift b/leetcode-swift/Easy/q021-merge-two-sorted-lists.swift
@@ -55,16 +55,16 @@ struct q21 {
         var l1 = LinkedListHelper.buildLinkedList(withNodes: [1,5,8,9,13])
         var l2 = LinkedListHelper.buildLinkedList(withNodes: [0,2,3,6,11,14])
         
-        print(Solution().mergeTwoLists(l1,l2))
+        print(Solution().mergeTwoLists(l1,l2) ?? "")
         
         l1 = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,4,5])
         l2 = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,4,5,6])
-        print(Solution().mergeTwoLists(l1, l2))
+        print(Solution().mergeTwoLists(l1, l2) ?? "")
         
         
         l1 = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,4,5])
         l2 = nil
-        print(Solution().mergeTwoLists(l1, l2))
+        print(Solution().mergeTwoLists(l1, l2) ?? "")
         
     }
 }
diff --git a/leetcode-swift/Easy/q024-swap-nodes-in-pairs.swift b/leetcode-swift/Easy/q024-swap-nodes-in-pairs.swift
@@ -42,6 +42,6 @@ struct q24 {
         
         let head = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,4,5,6,7,8,9])
         
-        print(Solution().swapPairs(head))
+        print(Solution().swapPairs(head) ?? "")
     }
 }
diff --git a/leetcode-swift/Easy/q083-remove-duplicates-from-sorted-list.swift b/leetcode-swift/Easy/q083-remove-duplicates-from-sorted-list.swift
@@ -45,7 +45,7 @@ struct q83 {
     
     static func getSolution() -> Void {
         let head = LinkedListHelper.buildLinkedList(withNodes: [1,1,3,4,4,5,5,6,6,7])
-        print(head)
-        print(Solution().deleteDuplicates(head))
+        print(head ?? "")
+        print(Solution().deleteDuplicates(head) ?? "")
     }
 }
diff --git a/leetcode-swift/Easy/q101-symmetric-tree.swift b/leetcode-swift/Easy/q101-symmetric-tree.swift
@@ -122,8 +122,6 @@ struct q101 {
     
     static func getSolution() -> Void {
         let root = BinaryTreeHelper.buildTree(withNodes: [6,82,82,nil,53,53,nil,-58,nil,nil,-58,nil,-85,-85,nil,-9,nil,nil,-9,nil,48,48,nil,33,nil,nil,33,81,nil,nil,81,5,nil,nil,5,61,nil,nil,61,nil,9,9,nil,91,nil,nil,91,72,7,7,72,89,nil,94,nil,nil,94,nil,89,-27,nil,-30,36,36,-30,nil,-27,50,36,nil,-80,34,nil,nil,34,-80,nil,36,50,18,nil,nil,91,77,nil,nil,95,95,nil,nil,77,91,nil,nil,18,-19,65,nil,94,nil,-53,nil,-29,-29,nil,-53,nil,94,nil,65,-19,-62,-15,-35,nil,nil,-19,43,nil,-21,nil,nil,-21,nil,43,-19,nil,nil,-35,-15,-62,86,nil,nil,-70,nil,19,nil,55,-79,nil,nil,-96,-96,nil,nil,-79,55,nil,19,nil,-70,nil,nil,86,49,nil,25,nil,-19,nil,nil,8,30,nil,82,-47,-47,82,nil,30,8,nil,nil,-19,nil,25,nil,49])
-        print(root)
-        
         print(Solution().isSymmetric(root))
         print(SolutionRecursively().isSymmetric(root))
     }
diff --git a/leetcode-swift/Easy/q102-binary-tree-level-order-traversal.swift b/leetcode-swift/Easy/q102-binary-tree-level-order-traversal.swift
@@ -65,7 +65,7 @@ struct q102 {
     
     static func getSolution() -> Void {
         let root = BinaryTreeHelper.buildTree(withNodes: [3,9,20,nil,nil,15,7])
-        print(root)
+        print(root ?? "")
         
         print(Solution().levelOrder(root))
     }
diff --git a/leetcode-swift/Easy/q104-maximum-depth-of-binary-tree.swift b/leetcode-swift/Easy/q104-maximum-depth-of-binary-tree.swift
@@ -38,7 +38,7 @@ struct q104 {
     static func getSolution() -> Void {
         let root = BinaryTreeHelper.buildTree(withNodes: [1,2,3,4,nil,6,7,8,nil,10,nil,nil,nil,14,15])
 
-        print(root)
+        print(root ?? "")
         
         print(Solution().maxDepth(root))
     }
diff --git a/leetcode-swift/Easy/q107-binary-tree-level-order-traversal-ii.swift b/leetcode-swift/Easy/q107-binary-tree-level-order-traversal-ii.swift
@@ -65,7 +65,7 @@ struct q107 {
     
     static func getSolution() -> Void {
         let root = BinaryTreeHelper.buildTree(withNodes: [3,9,20,nil,nil,15,7])
-        print(root)
+        print(root ?? "")
         print(Solution().levelOrderBottom(root))
     }
 }
diff --git a/leetcode-swift/Easy/q110-balanced-binary-tree.swift b/leetcode-swift/Easy/q110-balanced-binary-tree.swift
@@ -50,7 +50,7 @@ struct q110 {
 
     static func getSolution() -> Void {
         let root = BinaryTreeHelper.buildTree(withNodes: [1,2,3,4,5,6,7,8])
-        print(root)
+        print(root ?? "")
         print(Solution().isBalanced(root))
     }
 }
diff --git a/leetcode-swift/Easy/q111-minimum-depth-of-binary-tree.swift b/leetcode-swift/Easy/q111-minimum-depth-of-binary-tree.swift
@@ -57,7 +57,7 @@ struct q111 {
     
     static func getSolution() -> Void {
         let root = BinaryTreeHelper.buildTree(withNodes: [3,9,20,nil,nil,15,7])
-        print(root)
+        print(root ?? "")
         
         print(Solution().minDepth(root))
     }
diff --git a/leetcode-swift/Easy/q112-path-sum.swift b/leetcode-swift/Easy/q112-path-sum.swift
@@ -82,7 +82,7 @@ struct q112 {
     
     static func getSolution() -> Void {
         let root = BinaryTreeHelper.buildTree(withNodes: [5,4,8,11,nil,13,4,7,2,nil,1])
-        print(root)
+        print(root ?? "")
         
         print(Solution().hasPathSum(root, 22))
         print(Solution().hasPathSum(root, 9))
diff --git a/leetcode-swift/Easy/q160-intersection-of-two-linked-lists.swift b/leetcode-swift/Easy/q160-intersection-of-two-linked-lists.swift
@@ -78,25 +78,25 @@ struct q160 {
         var headA = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,7,8,9])
         var headB = LinkedListHelper.buildLinkedList(withNodes: [4,5,6])
         headB?.next?.next?.next = headA?.next?.next?.next
-        print(headA)
-        print(headB)
+        print(headA ?? "")
+        print(headB ?? "")
         
-        print(Solution().getIntersectionNode(headA, headB))
+        print(Solution().getIntersectionNode(headA, headB) ?? "")
         
         headA = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,7,8,9])
         headB = headA?.next?.next
-        print(headA)
-        print(headB)
+        print(headA ?? "")
+        print(headB ?? "")
         
-        print(Solution().getIntersectionNode(headA, headB))
+        print(Solution().getIntersectionNode(headA, headB) ?? "")
         
         headA = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,7,8,9])
         headB = LinkedListHelper.buildLinkedList(withNodes: [4,5,6])
-        print(headA)
-        print(headB)
+        print(headA ?? "")
+        print(headB ?? "")
         
-        print(Solution().getIntersectionNode(headA, headB))
+        print(Solution().getIntersectionNode(headA, headB) ?? "")
         
-        print(Solution().getIntersectionNode(nil, nil))
+        print(Solution().getIntersectionNode(nil, nil) ?? "")
     }
 }
diff --git a/leetcode-swift/Easy/q203-remove-linked-list-elements.swift b/leetcode-swift/Easy/q203-remove-linked-list-elements.swift
@@ -52,7 +52,7 @@ struct q203 {
     
     static func getSolution() -> Void {
         let head = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,1,1,2,1,2,3,1])
-        print(head)
-        print(Solution().removeElements(head, 1))
+        print(head ?? "")
+        print(Solution().removeElements(head, 1) ?? "")
     }
 }
diff --git a/leetcode-swift/Easy/q206-reverse-linked-list.swift b/leetcode-swift/Easy/q206-reverse-linked-list.swift
@@ -79,9 +79,9 @@ struct q206 {
     
     static func getSolution() -> Void {
         let head = LinkedListHelper.buildLinkedList(withNodes: [1,2])
-        print(head)
+        print(head ?? "")
         
         let reversedListHead = Solution2().reverseList(head)
-        print(reversedListHead)
+        print(reversedListHead ?? "")
     }
 }
diff --git a/leetcode-swift/Easy/q226-invert-binary-tree.swift b/leetcode-swift/Easy/q226-invert-binary-tree.swift
@@ -44,8 +44,8 @@ struct q226 {
     class Solution {
         func invertTree(_ root: TreeNode?) -> TreeNode? {
             if let node = root {
-                invertTree(node.left)
-                invertTree(node.right)
+                _ = invertTree(node.left)
+                _ = invertTree(node.right)
                 
                 (node.left, node.right) = (node.right, node.left)
             }
@@ -60,6 +60,6 @@ struct q226 {
         root.left!.right = TreeNode(2)
         root.left!.right!.right = TreeNode(3)
         
-        print(Solution().invertTree(root))
+        print(Solution().invertTree(root) ?? "")
     }
 }
diff --git a/leetcode-swift/Easy/q234-palindrome-linked-list.swift b/leetcode-swift/Easy/q234-palindrome-linked-list.swift
@@ -97,7 +97,7 @@ struct q234 {
     }
     static func getSolution() -> Void {
         let head = LinkedListHelper.buildLinkedList(withNodes: [1,1,2,1,1])
-        print(head)
+        print(head ?? "")
         print(Solution().isPalindrome(head))
     }
 }
diff --git a/leetcode-swift/Easy/q235-lowest-common-ancestor-of-a-binary-search-tree.swift b/leetcode-swift/Easy/q235-lowest-common-ancestor-of-a-binary-search-tree.swift
@@ -110,7 +110,7 @@ struct q235 {
         let root = BinaryTreeHelper.buildTree(withNodes: [10,5,14,1,8,12,15,nil,4,7,nil,11,13,nil,nil,nil,nil,2])
         let p = TreeNode(1), q = TreeNode(8)
         
-        print(root)
+        print(root ?? "")
         
         print(Solution2().lowestCommonAncestor(root!, p, q).val)
     }
diff --git a/leetcode-swift/Easy/q257-binary-tree-paths.swift b/leetcode-swift/Easy/q257-binary-tree-paths.swift
@@ -69,7 +69,7 @@ struct q257 {
         
         let root = BinaryTreeHelper.buildTree(withNodes: [1,2,3,4,5,6,7,8,9,10])
         
-        print(root)
+        print(root ?? "")
         print(Solution().binaryTreePaths(root))
     }
 }
diff --git a/leetcode-swift/Easy/q345-reverse-vowels-of-a-string.swift b/leetcode-swift/Easy/q345-reverse-vowels-of-a-string.swift
@@ -43,11 +43,11 @@ struct q345 {
             
             while  headIndex < tailIndex{
                 while !vowels.contains(s[headIndex]) && headIndex < tailIndex {
-                    headIndex = <#T##Collection corresponding to `headIndex`##Collection#>.index(after: headIndex)
+                    headIndex = s.index(after: headIndex)
                 }
                 
                 while !vowels.contains(s[tailIndex]) && headIndex < tailIndex {
-                    tailIndex = <#T##Collection corresponding to `tailIndex`##Collection#>.index(before: tailIndex)
+                    tailIndex = s.index(before: tailIndex)
                 }
                 
                 if headIndex == tailIndex {
@@ -58,8 +58,8 @@ struct q345 {
                 s.replaceSubrange(headIndex...headIndex, with: "\(s[tailIndex])")
                 s.replaceSubrange(tailIndex...tailIndex, with: "\(tmp)")
                 
-                headIndex = <#T##Collection corresponding to `headIndex`##Collection#>.index(after: headIndex)
-                tailIndex = <#T##Collection corresponding to `tailIndex`##Collection#>.index(before: tailIndex)
+                headIndex = s.index(after: headIndex)
+                tailIndex = s.index(before: tailIndex)
             }
             return s
         }
diff --git a/leetcode-swift/Medium/q103-binary-tree-zigzag-level-order-traversal.swift b/leetcode-swift/Medium/q103-binary-tree-zigzag-level-order-traversal.swift
diff --git a/leetcode-swift/Shared/main.swift b/leetcode-swift/Shared/main.swift

Original file line number	Diff line number	Diff line change
`@@ -35,11 +35,11 @@ struct q14 {`
`35`	`35`	`}`
`36`	`36`
`37`	`37`	`if var s = s {`
`38`		`- var subrange = s.characters.indices`
	`38`	`+ var endIndex = s.endIndex`
`39`	`39`	`for str in strs {`
`40`	`40`	`while !s.isEmpty && !str.hasPrefix(s) {`
`41`		`- subrange.upperBound = <#T##Collection corresponding to your index##Collection#>.index(before: subrange.upperBound)`
`42`		`- s = s[subrange]`
	`41`	`+ endIndex = s.index(before: endIndex)`
	`42`	`+ s = s.substring(to: endIndex)`
`43`	`43`	`}`
`44`	`44`	`}`
`45`	`45`	`return s`
`@@ -50,6 +50,6 @@ struct q14 {`
`50`	`50`	`}`
`51`	`51`
`52`	`52`	`static func getSolution() -> Void {`
`53`		`- print(Solution().longestCommonPrefix(["ab","ac","abc","abcd"]))`
	`53`	`+ print(Solution().longestCommonPrefix(["ab","ab","abc","abcd"]))`
`54`	`54`	`}`
`55`	`55`	`}`
Original file line number	Diff line number	Diff line change
`@@ -55,6 +55,6 @@ struct q19 {`
`55`	`55`
`56`	`56`	`static func getSolution() -> Void {`
`57`	`57`	`let head = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,4,5,6,7])`
`58`		`- print(Solution().removeNthFromEnd(head, 1))`
	`58`	`+ print(Solution().removeNthFromEnd(head, 1) ?? "")`
`59`	`59`	`}`
`60`	`60`	`}`
Original file line number	Diff line number	Diff line change
`@@ -42,6 +42,6 @@ struct q24 {`
`42`	`42`
`43`	`43`	`let head = LinkedListHelper.buildLinkedList(withNodes: [1,2,3,4,5,6,7,8,9])`
`44`	`44`
`45`		`- print(Solution().swapPairs(head))`
	`45`	`+ print(Solution().swapPairs(head) ?? "")`
`46`	`46`	`}`
`47`	`47`	`}`
Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ struct q83 {`
`45`	`45`
`46`	`46`	`static func getSolution() -> Void {`
`47`	`47`	`let head = LinkedListHelper.buildLinkedList(withNodes: [1,1,3,4,4,5,5,6,6,7])`
`48`		`- print(head)`
`49`		`- print(Solution().deleteDuplicates(head))`
	`48`	`+ print(head ?? "")`
	`49`	`+ print(Solution().deleteDuplicates(head) ?? "")`
`50`	`50`	`}`
`51`	`51`	`}`
Original file line number	Diff line number	Diff line change
`@@ -122,8 +122,6 @@ struct q101 {`
`122`	`122`
`123`	`123`	`static func getSolution() -> Void {`
`124`	`124`	let root = BinaryTreeHelper.buildTree(withNodes: [6,82,82,nil,53,53,nil,-58,nil,nil,-58,nil,-85,-85,nil,-9,nil,nil,-9,nil,48,48,nil,33,nil,nil,33,81,nil,nil,81,5,nil,nil,5,61,nil,nil,61,nil,9,9,nil,91,nil,nil,91,72,7,7,72,89,nil,94,nil,nil,94,nil,89,-27,nil,-30,36,36,-30,nil,-27,50,36,nil,-80,34,nil,nil,34,-80,nil,36,50,18,nil,nil,91,77,nil,nil,95,95,nil,nil,77,91,nil,nil,18,-19,65,nil,94,nil,-53,nil,-29,-29,nil,-53,nil,94,nil,65,-19,-62,-15,-35,nil,nil,-19,43,nil,-21,nil,nil,-21,nil,43,-19,nil,nil,-35,-15,-62,86,nil,nil,-70,nil,19,nil,55,-79,nil,nil,-96,-96,nil,nil,-79,55,nil,19,nil,-70,nil,nil,86,49,nil,25,nil,-19,nil,nil,8,30,nil,82,-47,-47,82,nil,30,8,nil,nil,-19,nil,25,nil,49])
`125`		`- print(root)`
`126`		`-`
`127`	`125`	`print(Solution().isSymmetric(root))`
`128`	`126`	`print(SolutionRecursively().isSymmetric(root))`
`129`	`127`	`}`
Original file line number	Diff line number	Diff line change
`@@ -65,7 +65,7 @@ struct q102 {`
`65`	`65`
`66`	`66`	`static func getSolution() -> Void {`
`67`	`67`	`let root = BinaryTreeHelper.buildTree(withNodes: [3,9,20,nil,nil,15,7])`
`68`		`- print(root)`
	`68`	`+ print(root ?? "")`
`69`	`69`
`70`	`70`	`print(Solution().levelOrder(root))`
`71`	`71`	`}`