commit changes to gh-pages dec 3

tg123 · tg123 · commit eeae21723e20 · 2014-12-03T00:48:56.000+08:00
diff --git a/_includes/_root/intersection-of-two-linked-lists/README.md b/_includes/_root/intersection-of-two-linked-lists/README.md
diff --git a/_includes/_root/intersection-of-two-linked-lists/Solution.java b/_includes/_root/intersection-of-two-linked-lists/Solution.java
@@ -0,0 +1,74 @@
+/**
+* Definition for singly-linked list.
+* public class ListNode {
+*     int val;
+*     ListNode next;
+*     ListNode(int x) {
+*         val = x;
+*         next = null;
+*     }
+* }
+*/
+public class Solution {
+
+  int len(ListNode head){
+
+    int len = 0;
+    ListNode iter = head;
+
+    while(iter != null){
+
+      len++;
+      iter = iter.next;
+    }
+
+    return len;
+  }
+
+  ListNode trim(ListNode head, int count){
+
+    ListNode iter = head;
+
+    while(iter != null && count > 0){
+
+      count--;
+      iter = iter.next;
+    }
+
+    return iter;
+  }
+
+
+  public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
+
+
+    int lenA = len(headA);
+    int lenB = len(headB);
+    int min  = Math.min(lenA, lenB);
+
+    ListNode iterA = trim(headA, lenA - min);
+    ListNode iterB = trim(headB, lenB - min);
+
+    ListNode intersection = null;
+
+
+    while(iterA != null && iterB != null){
+
+      if(iterA.val != iterB.val){
+        intersection = null;
+      } else if (intersection == null){
+        intersection = iterA;
+      }
+
+      iterA = iterA.next;
+      iterB = iterB.next;
+    }
+
+
+    if (iterA != null || iterB != null){
+      return null;
+    }
+
+    return intersection;
+  }
+}
diff --git a/_includes/_root/one-edit-distance/README.md b/_includes/_root/one-edit-distance/README.md
diff --git a/_includes/_root/one-edit-distance/Solution.java b/_includes/_root/one-edit-distance/Solution.java
@@ -0,0 +1,37 @@
+public class Solution {
+  public boolean isOneEditDistance(String s, String t) {
+
+    char[] S = s.toCharArray();
+    char[] T = t.toCharArray();
+
+    // make sure s is always to shorter one
+    if (S.length > T.length) return isOneEditDistance(t, s);
+
+    if (T.length - S.length > 1) return false;
+
+    int diff = 0;
+
+    int i = 0;
+    int j = 0;
+
+    for(/* void */; i < S.length; i++, j++){
+      if(S[i] != T[j]){
+
+        diff++;
+
+        if(diff > 1) return false;
+
+        // len(s) + 1 = len(t)
+        if(S.length != T.length && S[i] == T[j + 1]){
+          j++; // delete one from T
+        }
+      }
+    }
+
+    if (diff == 0){
+      return j + 1 == T.length;
+    }
+
+    return j == T.length;
+  }
+}
diff --git a/intersection-of-two-linked-lists/index.md b/intersection-of-two-linked-lists/index.md
@@ -1,7 +1,7 @@
 ---
 layout: solution
 title: Intersection of Two Linked Lists
-date: 2014-12-02 13:08:34+08:00
+date: 2014-12-02 13:09:51 +0800
 ---
 {% assign leetcode_name = {{page.path | remove: '/index.md'}}  %}
 {% assign leetcode_readme = {{leetcode_name | append: '/README.md' | prepend: '_root/' }}  %}
diff --git a/one-edit-distance/index.md b/one-edit-distance/index.md
@@ -1,7 +1,7 @@
 ---
 layout: solution
 title: One Edit Distance
-date: 2014-12-03 00:46:25+08:00
+date: 2014-12-03 00:47:41 +0800
 ---
 {% assign leetcode_name = {{page.path | remove: '/index.md'}}  %}
 {% assign leetcode_readme = {{leetcode_name | append: '/README.md' | prepend: '_root/' }}  %}
