Added 4 solutions

varunu28 · varunu28 · commit e7d20f286d16 · 2017-09-11T14:05:23.000-07:00
diff --git a/Easy/Assign Cookies.java b/Easy/Assign Cookies.java
@@ -0,0 +1,17 @@
+class Solution {
+    public int findContentChildren(int[] g, int[] s) {
+        Arrays.sort(g);
+        Arrays.sort(s);
+        int count = 0;
+        for (int i=0;i<g.length;i++) {
+            for (int j=0;j<s.length;j++) {
+                if (g[i] <= s[j]) {
+                    s[j] = 0;
+                    count++;
+                    break;
+                }
+            }
+        }
+        return count;
+    }
+}
diff --git a/Easy/Climbing Stairs.java b/Easy/Climbing Stairs.java
@@ -0,0 +1,18 @@
+class Solution {
+    public int climbStairs(int n) {
+        if (n == 1) return 1;
+        if (n == 2) return 2;
+        
+        int oneStep = 2;
+        int twoStep = 1;
+        int all = 0;
+        
+        for (int i=2;i<n;i++) {
+            all = oneStep + twoStep;
+            twoStep = oneStep;
+            oneStep = all;
+        }
+        
+        return all;
+    }
+}
diff --git a/Easy/Longest Continuous Increasing Subsequence.java b/Easy/Longest Continuous Increasing Subsequence.java
@@ -0,0 +1,19 @@
+class Solution {
+    public int findLengthOfLCIS(int[] nums) {
+        if (nums.length == 0) return 0;
+        if (nums.length == 1) return 1;
+        
+        int c = 1;
+        int maxL = 1;
+        for (int i=1;i<nums.length;i++) {
+            if (nums[i-1] < nums[i]) {
+                c++;
+            }
+            else {
+                maxL = Math.max(c,maxL);
+                c = 1;
+            }
+        }
+        return Math.max(c,maxL);
+    }
+}
diff --git a/Easy/Longest Palindrome.java b/Easy/Longest Palindrome.java
@@ -0,0 +1,28 @@
+class Solution {
+    public int longestPalindrome(String s) {
+        int[] count = new int[52];
+        
+        for (int i=0;i<s.length();i++) {
+            int ind = ((int) s.charAt(i));
+            if (ind >= 97) {
+                ind -= 97;
+            }
+            else {
+                ind = ind + 26 - 65;
+            }
+            count[ind]++;
+        }
+        
+        int l = 0;
+        for (int i=0;i<52;i++) {
+            if (count[i]%2 == 0) {
+                l += count[i];
+            }
+            else {
+                l += count[i]-1;
+            }
+        }
+        
+        return s.length() > l ? l+1 : l; 
+    }
+}
