Merge pull request #224 from hellomrsun/master

Add Pow(x,n) C#

Author: jinshendan

July-LeetCoding-Challenge/16-Pow(x,n)/Pow(x,n).cs

@@ -0,0 +1,13 @@
+public class Solution {
+    public double MyPow(double x, int n) {
+        if(n < 0) return Pow(1/x, -n);
+        return Pow(x, n);
+    }
+    
+    public double Pow(double x, int n){
+        if(n == 0) return 1;
+        if(n == 1) return x;
+        if(n % 2 == 0) return Pow(x * x, n/2);
+        return x * Pow(x * x, n / 2);
+    }
+}

README.md

@@ -22,6 +22,8 @@ Solutions in various programming languages are provided. Enjoy it.
 13. [Same Tree](https://github.com/AlgoStudyGroup/Leetcode/tree/master/July-LeetCoding-Challenge/13-Same-Tree): DFS
 14. [Angle Between Hands of a Clock](https://github.com/AlgoStudyGroup/Leetcode/tree/master/July-LeetCoding-Challenge/14-Angle-Between-Hands-of-a-Clock): Math
 15. [Reverse Words in a String](https://github.com/AlgoStudyGroup/Leetcode/tree/master/July-LeetCoding-Challenge/15-Reverse-Words-in-a-String): Pointer
+16. [16-Pow(x,n)](https://github.com/AlgoStudyGroup/Leetcode/tree/master/July-LeetCoding-Challenge/16-Pow(x,n)): Recursion
+
 
 ## June LeetCoding Challenge
 Click [here](https://leetcode.com/explore/challenge/card/june-leetcoding-challenge/) for problem descriptions.