Merge pull request #998 from agnihotriketan/patch-3

C# 300-Longest-Increasing-Subsequence.cs

Author: Ahmad-A0

csharp/300-Longest-Increasing-Subsequence.cs

@@ -0,0 +1,18 @@
+public class Solution {
+    public int LengthOfLIS(int[] nums) {
+         int[] dp = new int[nums.Length];
+            Array.Fill(dp, 1);
+
+            for (int i = nums.Length - 1; i >= 0; i--)
+            {
+                for (int j = i + 1; j < nums.Length; j++)
+                {
+                    if (nums[i] < nums[j])
+                    {
+                        dp[i] = Math.Max(dp[i], 1 + dp[j]);
+                    }
+                }
+            }
+            return dp.Max();
+    }
+}