add 118 to notes

Author: Li Li

LeetcodeCShaprDotNetCore/Program.cs

@@ -3,6 +3,8 @@
 namespace LeetcodeCShaprDotNetCore {
     class Program {
         static void Main(string[] args) {
+            
+
         }
     }
 }

LeetcodeCShaprDotNetCore/Solution.cs

@@ -1,30 +1,25 @@
 using System;
 using System.Collections.Generic;
 using System.Text;
+
+
 namespace LeetcodeCShaprDotNetCore {
     public class Solution {
-        public bool IsPalindrome(string s) {
-            if (s.Length == 0) return true;
-            int left = 0, right = s.Length - 1;
-            char leftChar, rightChar;
-            while (left <= right) {
-                leftChar = s[left];
-                rightChar = s[right];
-                if (!char.IsLetterOrDigit(leftChar)){
-                    left++;
-                } else if (!char.IsLetterOrDigit(rightChar)) {
-                    right--;
-                } else {
-                    if (char.ToLower(leftChar) != char.ToLower(rightChar)) {
-                        return false;
+        public IList<IList<int>> Generate(int numRows) {
+            IList<IList<int>> result = new List<IList<int>>();
+            for (int row = 0; row < numRows; row++) {
+                IList<int> list = new List<int>();
+                for (int i = 0; i < row + 1; i++) {
+                    if (i == 0 || i == row) {
+                        list.Add(1);
+                    } else {
+                        var preList = result[row - 1];
+                        list.Add(preList[i - 1] + preList[i]);
                     }
-                    left++;
-                    right--;
                 }
+                result.Add(list);
             }
-            return true;
+            return result;
         }
     }
-}
-
-// 12321  1234
+}

README.md

@@ -3,7 +3,7 @@
 I will use this repository to make notes for leetcode solutions and classify the problems by different topics.
 
 ## Solved Problem List
-Total solved: 68
+Total solved: 69
 
 ### top-interview-questions
 
@@ -12,6 +12,7 @@ ID | Difficulty | Tags | Solution
 14 | Easy | String | [Longest Common Prefix](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/14.%20Longest%20Common%20Prefix.cs)
 38 | Easy | String | [Count and Say](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/38.%20Count%20and%20Say.cs)
 53 | Easy | Dynamic Programming, Divide and Conquer | [Maximum Subarray](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/53.%20Maximum%20Subarray.cs)
+118 | Easy | Array, Math | [Pascal's Triangle](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/118.%20Pascal's%20Triangle.cs)
 155 | Easy | Stack, Design | [Min Stack](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/155.%20Min%20Stack.cs)
 160 | Easy | LinkedList | [Intersection of Two Linked Lists](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/160.%20Intersection%20of%20Two%20Linked%20Lists.cs)
 169 | Easy | Dictionary | [Majority Element](https://github.com/kflili/LeetcodeCShaprDotNetCore/blob/master/Algorithms%20Basics/top-interview-questions/169.%20Majority%20Element.cs)