add 2d matrix ii and del node

Author: tg123

delete-node-in-a-linked-list/README.md

@@ -0,0 +1,14 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+    public void deleteNode(ListNode node) {
+        node.val  = node.next.val;
+        node.next = node.next.next;
+    }
+}

delete-node-in-a-linked-list/Solution.java

@@ -0,0 +1,7 @@
+---
+layout: solution
+title: Delete Node in a Linked List
+date: 2015-07-26 14:42:29+08:00
+leetcode_id: 237
+---
+{% include_relative README.md %}

delete-node-in-a-linked-list/index.md

@@ -0,0 +1,32 @@
+public class Solution {
+
+    boolean searchMatrix(int[][] matrix, int stX, int stY, int edX, int edY, int target) {
+
+        if (stX >= edX || stY >= edY) return false;
+
+        int max = matrix[edX - 1][edY - 1];
+        int min = matrix[stX][stY];
+
+        // min <= target <= max
+        if (min <= target && target <= max){
+
+            int mdX = (stX + edX) / 2;
+            int mdY = (stY + edY) / 2;
+
+            if(matrix[mdX][mdY] == target){
+                return true;
+            }
+
+            return searchMatrix(matrix, stX, stY, mdX, mdY, target) ||
+                   searchMatrix(matrix, stX, mdY, mdX, edY, target) ||
+                   searchMatrix(matrix, mdX, stY, edX, mdY, target) ||
+                   searchMatrix(matrix, mdX, mdY, edX, edY, target);
+        }
+
+        return false;
+    }
+
+    public boolean searchMatrix(int[][] matrix, int target) {
+        return searchMatrix(matrix, 0, 0, matrix.length, matrix[0].length, target);
+    }
+}

search-a-2d-matrix-ii/README.md

@@ -0,0 +1,7 @@
+---
+layout: solution
+title: Search a 2D Matrix II
+date: 2015-07-26 14:40:48+08:00
+leetcode_id: 240
+---
+{% include_relative README.md %}