增加No155

Author: tujietg

.idea/leetcode.iml

@@ -1,25 +1,23 @@
-package Algorithm.leetcode.binarysearch;
 
 /**
- * 
  * Created by tujietg on Nov 6, 2019
  */
 public class No744 {
-	public char nextGreatestLetter(char[] letters, char target) {
-		int len = letters.length;
-		int tarInt = target - 'A' + 1;
-		int lerInt = letters[len - 1] - 'A' + 1;
-		if (target == 'z' || tarInt >= lerInt) {
-			return letters[0];
-		}
-		int i;
-		for (i = 1; i < len; i++) {
-			int leInt = letters[i - 1] - 'A' + 1;
-			if (leInt > tarInt) {
-				break;
-			}
-		}
-		return letters[i - 1];
-	}
+    public char nextGreatestLetter(char[] letters, char target) {
+        int len = letters.length;
+        int tarInt = target - 'A' + 1;
+        int lerInt = letters[len - 1] - 'A' + 1;
+        if (target == 'z' || tarInt >= lerInt) {
+            return letters[0];
+        }
+        int i;
+        for (i = 1; i < len; i++) {
+            int leInt = letters[i - 1] - 'A' + 1;
+            if (leInt > tarInt) {
+                break;
+            }
+        }
+        return letters[i - 1];
+    }
 
 }

.idea/workspace.xml

@@ -0,0 +1,45 @@
+import java.util.LinkedList;
+
+/**
+ * @author tujietg
+ * @date 5/13/20 9:48 AM
+ */
+public class No155 {
+
+    LinkedList<Integer> list = null;
+    LinkedList<Integer> minList = null;
+
+    /**
+     * initialize your data structure here.
+     */
+    public No155() {
+        list = new LinkedList();
+        minList = new LinkedList();
+
+    }
+
+    public void push(int x) {
+        list.addFirst(x);
+        if (minList.size() == 0 || minList.element() >= x) {
+            minList.addFirst(x);
+        }
+    }
+
+    public void pop() {
+        if (minList.get(0).equals(list.element())) {
+            minList.poll();
+        }
+        list.poll();
+    }
+
+    public int top() {
+        return list.element();
+
+    }
+
+    public int getMin() {
+        return minList.get(0);
+    }
+
+
+}