第一周作业_050

Week_01/id_50/LeetCode_1021_050.java

@@ -0,0 +1,62 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Stack;
+
+
+
+/**
+ * @author yu
+ * 删除最外层的括号
+ */
+public class LeetCode_1021_050 {
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		LeetCode_1021_050 solution = new LeetCode_1021_050();
+		System.out.println(solution.removeOuterParentheses("(())(()(()))"));
+	}
+
+	public String removeOuterParentheses(String S) {
+	       if(S == null){
+				return null;
+			}
+			if(S.length() == 0){
+				return "";
+			}
+			char[] charArr = S.toCharArray();
+			Stack<Character> stack = new Stack<>();
+			StringBuilder strBuild = new StringBuilder();
+			int n = 0;
+			Set<Integer> setval = new HashSet<>();
+			for(int i=0; i<charArr.length; i++){
+				if(stack.size()==0){
+					stack.add(charArr[i]);
+					setval.add(i);
+					n++;
+					continue;
+				}
+				StringBuilder strtmp = new StringBuilder();
+				if(strtmp.append(stack.get(stack.size()-1)).append(charArr[i]).toString().equals("()")){
+					if(stack.size()==1 && n==1){
+						setval.add(i);
+						n=0;
+					}
+					stack.pop();
+				}else{
+					stack.add(charArr[i]);					
+				}
+			}
+			for(int i=0; i<charArr.length; i++){
+				if(!setval.contains(i)){
+					strBuild.append(charArr[i]);
+				}
+			}
+			return strBuild.toString();
+	    }
+}

Week_01/id_50/LeetCode_1047_050.java

@@ -0,0 +1,51 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Stack;
+
+
+
+/**
+ * @author yu
+ * 删除字符串中的所有相邻重复项
+ */
+public class LeetCode_1047_050 {
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		LeetCode_1047_050 solution = new LeetCode_1047_050();
+		System.out.println(solution.removeDuplicates("abbacaacdad"));
+	}
+
+	public String removeDuplicates(String S) {
+        if(S == null){
+			return null;
+		}
+		if(S.length() == 0){
+			return "";
+		}
+		char[] charArr = S.toCharArray();
+		Stack<Character> stack = new Stack<>();
+		for(char c : charArr){
+			if(stack.size()==0){
+				stack.add(c);			
+			}else{
+				if(c == stack.get(stack.size()-1)){
+					stack.pop();
+				}else{
+					stack.add(c);
+				}
+			}
+		}
+		StringBuilder strBuild = new StringBuilder();
+		for(Character c: stack){
+			strBuild.append(c);
+		}
+		return strBuild.toString();
+    }
+}

Week_01/id_50/LeetCode_104_050.java

@@ -0,0 +1,32 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Stack;
+
+
+
+/**
+ * @author yu
+ * 二叉树的最大深度
+ */
+public class LeetCode_441_050 {
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+	}
+
+	public int maxDepth(TreeNode root) {
+        if(root == null){
+			return 0;
+		}else{
+			int left = maxDepth(root.left);
+			int right = maxDepth(root.right);
+			return Math.max(left, right)+1;
+		}
+    }
+}

Week_01/id_50/LeetCode_111_050.java

@@ -0,0 +1,43 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Stack;
+
+
+
+/**
+ * @author yu
+ * 二叉树的最小深度
+ */
+public class LeetCode_111_050 {
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+	}
+
+	public int minDepth(TreeNode root) {
+        if(root == null){
+			return 0;
+		}else{
+			if(root.left == null && root.right == null){
+				return 1;
+			}
+			int min_val = Integer.MAX_VALUE;
+			if(root.left != null){
+				int left = minDepth(root.left);
+				min_val = Math.min(left, min_val);
+
+			}
+			if(root.right != null){
+				int right = minDepth(root.right);
+				min_val = Math.min(right, min_val);
+			}
+			return min_val+1;
+		}
+    }
+}

Week_01/id_50/LeetCode_189_050.java

@@ -0,0 +1,62 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Stack;
+
+
+
+/**
+ * @author yu
+ *  删除排序数组中的重复项
+ */
+public class LeetCode_189_050 {
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		LeetCode_189_050 solution = new LeetCode_189_050();
+		int[] nums = {1,2};
+		String[] strs = {"nozzle","punjabi","waterlogged","imprison","crux","numismatists"};
+//		System.out.println(solution.removeDuplicates(nums));
+		solution.rotate(nums, 1);	
+//		System.out.println(solution.isAnagram("dgqztusjuu", "dqugjzutss"));
+//		solution.groupAnagrams(strs);
+//		System.out.println(solution.removeDuplicates("abbacaacdad"));
+//		System.out.println(solution.removeOuterParentheses("(())(()(()))"));
+//		System.out.println(solution.arrangeCoins(2147483647));
+//		System.out.println(solution.myPow(2, 10));
+	}
+
+	public void rotate(int[] nums, int k) {
+		k = k%nums.length;
+		if( k<=0 ){
+			return;
+		}
+        int val = 0;
+        for(int i=0; i<(nums.length-k)/2; i++){
+        	val=nums[i];
+        	nums[i] = nums[nums.length-1-k-i];
+        	nums[nums.length-1-k-i] = val;
+
+        }
+        for(int i=nums.length-k; i<nums.length-k+k/2; i++){
+        	val=nums[i];
+        	nums[i] = nums[nums.length-1-(i-(nums.length-k))];
+        	nums[nums.length-1-(i-(nums.length-k))] = val;
+        }
+        for(int i=0; i<(nums.length)/2; i++){
+        	val=nums[i];
+        	nums[i] = nums[nums.length-1-i];
+        	nums[nums.length-1-i] = val;
+//        	System.out.println(nums[i]);
+        }
+//        for(int i=0; i<nums.length; i++){
+//        	System.out.println(nums[i]);        	
+//        }
+        return;
+	}
+}

Week_01/id_50/LeetCode_242_050.java

@@ -0,0 +1,54 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Stack;
+
+
+
+/**
+ * @author yu
+ * 有效的字母异位词
+ */
+public class LeetCode_242_050 {
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		LeetCode_242_050 solution = new LeetCode_242_050();
+		int[] nums = {1,2};
+		String[] strs = {"nozzle","punjabi","waterlogged","imprison","crux","numismatists"};
+		System.out.println(solution.isAnagram("dgqztusjuu", "dqugjzutss"));
+	}
+
+	public boolean isAnagram(String s, String t) {
+        if(s == null || t == null){
+			return false;
+		}
+		if(s.length() != t.length()){
+			return false;
+		}
+		Map<Object, Integer> map1 = new HashMap<>();
+		Map<Object, Integer> map2 = new HashMap<>();
+		for(int i=0; i<s.length(); i++){
+			if(map1.get(s.charAt(i)) != null){
+				map1.put(s.charAt(i), map1.get(s.charAt(i))+1);
+			}else{
+				map1.put(s.charAt(i), 1);				
+			}
+		}
+		for(int i=0; i<t.length(); i++){
+			if(map2.get(t.charAt(i)) != null){
+				map2.put(t.charAt(i), map2.get(t.charAt(i))+1);
+			}else{
+				map2.put(t.charAt(i), 1);				
+			}
+		}
+
+
+		return map1.equals(map2);
+    }
+}

Week_01/id_50/LeetCode_26_050.java

@@ -0,0 +1,48 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.Stack;
+
+
+
+/**
+ * @author yu
+ *  删除排序数组中的重复项
+ */
+public class LeetCode_26_050 {
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		LeetCode_26_050 solution = new LeetCode_26_050();
+		int[] nums = {1,2};
+		System.out.println(solution.removeDuplicates(nums));
+	}
+
+	public int removeDuplicates(int[] nums) {
+		int n = 0;
+		for(int i=0; i<nums.length; i++){
+			for(int j=0; j<=n; j++){
+				if(i==0){
+//					System.out.println(nums[i]);
+					n++;
+					break;
+				}
+				if(nums[i]==nums[j]){
+					break;
+				}else{
+					if(j==(n-1)){
+						nums[n]=nums[i];
+//						System.out.println(nums[i]);
+						n++;
+					}
+				}
+			}
+		}
+        return n;
+    }
+}