feat: add the solution of Same Tree(100) with kotlin.

Author: relish-wang

README.md

@@ -47,7 +47,7 @@
 | [070][070-question] | [Climbing Stairs][070-tips]                                  | [✅][070-java] |              | [✅][070-kotlin] |
 | [083][083-question] | [Remove Duplicates from Sorted List][083-tips]               | [✅][083-java] |              | [✅][083-kotlin] |
 | [088][088-question] | [Merge Sorted Array][088-tips]                               | [✅][088-java] |              | [✅][088-kotlin] |
-| [100][100-question] | [Same Tree][100-tips]                                        | [✅][100-java] |              |                  |
+| [100][100-question] | [Same Tree][100-tips]                                        | [✅][100-java] |              | [✅][100-kotlin] |
 | [101][101-question] | [Symmetric Tree][101-tips]                                   | [✅][101-java] |              |                  |
 | [104][104-question] | [Maximum Depth of Binary Tree][104-tips]                     | [✅][104-java] |              |                  |
 | [107][107-question] | [Binary Tree Level Order Traversal II][107-tips]             | [✅][107-java] |              |                  |
@@ -497,4 +497,5 @@
 [070-kotlin]: ./src/_070/kotlin/Solution.kt
 [083-kotlin]: ./src/_083/kotlin/Solution.kt
 [088-kotlin]: ./src/_088/kotlin/Solution.kt
+[100-kotlin]: ./src/_100/kotlin/Solution.kt
 [771-kotlin]: ./src/_771/kotlin/Solution.kt

src/_100/kotlin/Solution.kt

@@ -0,0 +1,34 @@
+package _100.kotlin
+
+import structure.TreeNode
+
+/**
+ * @author relish
+ * @since 2018/04/25
+ */
+/**
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int = 0) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
+class Solution {
+    fun isSameTree(p: TreeNode?, q: TreeNode?): Boolean {
+        if (p == null && q == null) return true
+        if (p == null || q == null) return false
+        return p.`val` == q.`val` && isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
+    }
+}
+
+fun main(args: Array<String>) {
+    val p = TreeNode(1)
+    p.left = TreeNode(2)
+    p.right = TreeNode(2)
+
+    val q = TreeNode(1)
+    q.left = TreeNode(2)
+    q.right = TreeNode(2)
+
+    println(Solution().isSameTree(p, q))
+}

tips/100/README.md

@@ -49,6 +49,7 @@ Output: false
 
 题意是比较两棵二叉树是否相同，那么我们就深搜比较各个节点即可。
 
+java:
 ```java
 /**
  * Definition for a binary tree node.
@@ -71,6 +72,16 @@ class Solution {
 }
 ```
 
+kotlin(184ms/100.00%):
+```kotlin
+class Solution {
+    fun isSameTree(p: TreeNode?, q: TreeNode?): Boolean {
+        if (p == null && q == null) return true
+        if (p == null || q == null) return false
+        return p.`val` == q.`val` && isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
+    }
+}
+```
 
 ## 结语