add 001 027 243

Author: xxg1413

001.Two Sum/Two Sum.md renamed to 001.Two Sum/001.md

@@ -1,5 +1,7 @@
-##[Two Sum](https://leetcode.com/problems/two-sum/)  
+##tag
+Array  Hash Table
 
+##Two Sum
 Given an array of integers, find two numbers such that they add up to a specific target number.
 
 The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

001.Two Sum/Jimmy Xiang/001_update.go

@@ -1,44 +1,16 @@
-package main
-
-import (
-	"fmt"
-)
-
-func twoSum(arr []int, value int) []int {
-
-	res := [2]int{-1, -1}
-
-	for i, v := range arr {
-
-		for j, o := range arr {
-
-			if i < j && (value-v) == o {
-
-				res[0] = i
-				res[1] = j
-
-				return res[:]
-			}
-		}
-	}
-
-	return res[:]
-
-}
-
-func main() {
-
-	arr := []int{222, 333, 11, 2, 3, 0, -2, 1, 2, 3}
-
-	sum := 0
-
-	result := twoSum(arr, sum)
-
-	if result[0] != -1 {
-
-		fmt.Printf("arr[%d]:%d  + arr[%d]:%d  =  %d \n", result[0], arr[result[0]], result[1], arr[result[1]], sum)
-	} else {
-		fmt.Println("cann't find the numbers")
-	}
-
+func twoSum(nums []int, target int) []int {
+    res := [2]int{-1,-1}
+    
+    for i, v := range nums {
+        for j, o := range nums {
+            if i < j && (target-v) == o {
+                res[0]=i
+                res[1]=j
+                
+                return res[:]
+            }
+        }
+    }
+    
+    return res[:]
 }

001.Two Sum/Jimmy Xiang/001_update.py

@@ -7,8 +7,8 @@ def twoSum(self, nums, target):
         """
         d = {}
         for i in range(len(nums)):
-            if d.get(target - nums[i], None) == None:
+            find = target  - nums[i]
+            if d.get(find, None) == None:
                 d[nums[i]] = i
             else:
-                return (d[target - nums[i] ], i)
-
+                return [d[find], i]

027.Remove Element/027.md

@@ -0,0 +1,17 @@
+##tag
+Array Two Pointers
+
+
+##Remove Element
+Given an array and a value, remove all instances of that value in place and return the new length.
+
+Do not allocate extra space for another array, you must do this in place with constant memory.
+
+The order of elements can be changed. It doesn't matter what you leave beyond the new length.
+
+Example:
+Given input array nums = [3,2,2,3], val = 3
+
+Your function should return length = 2, with the first two elements of nums being 2.
+
+

027.Remove Element/jimmy Xiang/027.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def removeElement(self, nums, val):
+        """
+        :type nums: List[int]
+        :type val: int
+        :rtype: int
+        """
+
+        num = 0
+
+        for i in range(len(nums)):
+            if nums[i] == val:
+                continue
+            nums[num] = nums[i]
+            num += 1
+
+        return num
+
+

243.Shortest Word Distance/243.md

@@ -0,0 +1,18 @@
+#tag
+Array
+
+##Shortest Word Distance
+
+Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.
+
+For example,
+Assume that words = ["practice", "makes", "perfect", "coding", "makes"].
+
+Given word1 = "coding", word2 = "practice", return 3.
+Given word1 = "makes", word2 = "coding", return 1.
+
+Note:
+You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.
+
+
+

243.Shortest Word Distance/Jimmy Xiang/243.py

@@ -0,0 +1,23 @@
+class Solution:
+    def sortestDistance(self, words, word1, word2):
+        dist = float("inf")
+        i, index1,index2 = 0, None, None
+        while i < len(words):
+            if words[i] == word1:
+                index1 = i
+            elif words[i] == word2:
+                index2 = i
+            if index1 is not None and index2 is not None:
+                dist = min(dist, abs(index1 - index2))
+
+            i += 1
+
+        return dist
+
+
+
+s=Solution()
+a=["a","b","c","d"]
+print s.sortestDistance(a,"c","d")
+
+