too old to catch up with leetcode

Author: tg123

missing-number/README.md

@@ -0,0 +1,36 @@
+public class Solution {
+
+    void swap(int[] nums, int i, int j){
+        int t   = nums[i];
+        nums[i] = nums[j];
+        nums[j] = t;
+    }
+
+    void sort(int[] nums){
+
+        for(int i = 0; i < nums.length; i++){
+            while(nums[i] != i){
+                if(nums[i] < 0) break;
+
+                if(nums[i] >= nums.length) {
+                    nums[i] = -1;
+                    break; // drop
+                }
+
+                swap(nums, nums[i], i);
+            }
+        }
+    }
+
+    public int missingNumber(int[] nums) {
+        sort(nums);
+
+        for(int i = 0; i < nums.length; i++){
+            if(nums[i] != i){
+                return i;
+            }
+        }
+
+        return nums.length;
+    }
+}

missing-number/Solution.java

@@ -0,0 +1,7 @@
+---
+layout: solution
+title: Missing Number
+date: 2015-08-24 12:56:25+08:00
+leetcode_id: 268
+---
+{% include_relative README.md %}

missing-number/index.md

@@ -0,0 +1,23 @@
+public class Solution {
+    public int shortestDistance(String[] words, String word1, String word2) {
+
+        int len = words.length;
+
+        int i1 = -1;
+        int i2 = -1;
+
+        for(int i = 0; i < words.length; i++){
+            if(word1.equals(words[i])){
+                i1 = i;
+            }else if(word2.equals(words[i])){
+                i2 = i;
+            }
+
+            if(i1 >= 0 && i2 >= 0){
+                len = Math.min(len, Math.abs(i1 - i2));
+            }
+        }
+
+        return len;
+    }
+}

shortest-word-distance/README.md

@@ -0,0 +1,7 @@
+---
+layout: solution
+title: Shortest Word Distance
+date: 2015-08-17 01:11:54+08:00
+leetcode_id: 243
+---
+{% include_relative README.md %}