two drafts

fishercoder1534 · fishercoder1534 · commit e60f420697e5 · 2016-08-08T17:32:09.000-07:00
diff --git a/EASY/src/easy/StringToInteger.java b/EASY/src/easy/StringToInteger.java
@@ -0,0 +1,33 @@
+package easy;
+/**8. String to Integer (atoi)  QuestionEditorial Solution  My Submissions
+Total Accepted: 115114
+Total Submissions: 839893
+Difficulty: Easy
+Implement atoi to convert a string to an integer.
+
+Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.
+
+Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front.*/
+
+/**Requirements for atoi:
+The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value.
+
+The string can contain additional characters after those that form the integral number, which are ignored and have no effect on the behavior of this function.
+
+If the first sequence of non-whitespace characters in str is not a valid integral number, or if no such sequence exists because either str is empty or it contains only whitespace characters, no conversion is performed.
+
+If no valid conversion could be performed, a zero value is returned. If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is returned.*/
+public class StringToInteger {
+	public int myAtoi(String str) {
+		//case 1: str is greater than Integer.MAX_VALUE, return Integer.MAX_VALUE as the question states it
+		
+		//case 2: str is smaller than Integer.MIN_VALUE, return Integer.MIN_VALUE as the question states it
+		
+		//case 3: str contains non-numeric values
+		
+		//case 4: there're many leading whitespace characters which we'll have to ignore
+		
+		//case 5: when finding the first non-whitespace character, it could possibly be a '+' or '-' sign, after that, we parse all the consecutive numbers
+		return 0;
+	}
+}
diff --git a/MEDIUM/src/medium/RandomizedSet.java b/MEDIUM/src/medium/RandomizedSet.java
@@ -7,7 +7,8 @@
 import java.util.Random;
 import java.util.Set;
 
-/**This solution get AC'ed. Although it's not really doing random*/
+/**This solution get AC'ed. Although it's not really doing random 8/4/2016
+ * Now, they've updated the test case and also the question description: Each element must have the same probability of being returned.*/
 public class RandomizedSet {
     
     Set<Integer> set;
@@ -27,7 +28,7 @@ public boolean insert(int val) {
     }
     
     /** Deletes a value from the set. Returns true if the set contained the specified element. */
-    public boolean delete(int val) {
+    public boolean remove(int val) {
         return set.remove(val);
     }
     
@@ -63,8 +64,6 @@ public static void main(String...args){
  * int param_3 = obj.getRandom();
  */
 
-/**TODO: submit this solution on OJ later, it's throwing cannot find symbol remove() method on line 16,
- * this is an OJ bug that people reported on Discuss, submit it later, see if it can get AC'ed.*/
 class RandomizedSet_2nd_solution {
     
     Map<Integer, Integer> forwardMap;//key is auto increment index, value if the inserted val
@@ -91,7 +90,7 @@ public boolean insert(int val) {
     }
     
     /** Deletes a value from the set. Returns true if the set contained the specified element. */
-    public boolean delete(int val) {
+    public boolean remove(int val) {
         if(forwardMap.containsValue(val)){
             int key = reverseMap.get(val);
             reverseMap.remove(val);
