Merge https://github.com/xxg1413/leetcode

We should keep practising.

Author: coderfive

001.Two Sum/Jimmy Xiang/001.go

@@ -0,0 +1,44 @@
+package main
+
+import (
+	"fmt"
+)
+
+func twoSum(arr []int, value int) (result [2]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")
+	}
+
+}

001.Two Sum/Jimmy Xiang/TwoSum.py

@@ -1,17 +1,17 @@
 #!/usr/bin/env python
 
-class Solution(object):
-	def twoSum(self, nums, target):
+class Solution(object):      
+	def twoSum(self, nums, target): 
 		d = {}
 		for i in range(len(nums)):
-			if d.get(target - nums[i], None) == None:      #not found 
+			if d.get(target - nums[i], None) == None:       #not found 
 				d[nums[i]] = i
 			else:
 				return [d[target - nums[i] ] + 1 , i + 1]  #rtype list 
 
 
 
-nums = [6,1,2,7]
+nums = [6,1,2,7]  
 target = 9
 
 s = Solution()

002.Add Two Numbers/Jimmy Xiang/002.go

@@ -0,0 +1,65 @@
+package main
+
+import (
+	"container/list"
+	"fmt"
+)
+
+func addTwoNumbers(a *list.List, b *list.List) (c *list.List) {
+
+	d := list.New()
+
+	for e1, e2 := a.Front(), b.Front(); e1 != nil && e2 != nil; e1, e2 = e1.Next(), e2.Next() {
+
+		v1 := e1.Value.(int) //e1.Value 为 interface{}
+		v2 := e2.Value.(int)
+
+		value := (v1 + v2) % 10
+
+		d.PushBack(value)
+
+		if e1.Next() == nil {
+
+			for e2.Next() != nil {
+
+				d.PushBack(e2.Next().Value.(int))
+				e2 = e2.Next()
+			}
+		}
+
+		if e2.Next() == nil {
+
+			for e1.Next() != nil {
+
+				d.PushBack(e1.Next().Value.(int))
+				e1 = e1.Next()
+			}
+
+		}
+
+	}
+
+	return d
+}
+
+func main() {
+
+	a := list.New()
+	b := list.New()
+	c := list.New()
+
+	a.PushBack(1)
+	a.PushBack(2)
+	a.PushBack(9)
+	a.PushBack(4)
+
+	b.PushBack(3)
+	b.PushBack(7)
+
+	c = addTwoNumbers(a, b)
+
+	for e := c.Front(); e != nil; e = e.Next() {
+
+		fmt.Println(e.Value)
+	}
+}

002.Add Two Numbers/Jimmy Xiang/Add Two Numbers.cpp

@@ -0,0 +1,44 @@
+package main
+
+import (
+	"fmt"
+)
+
+func lengthOfLongestSubstring(str string) int {
+
+	arr := [256]int{}
+
+	for _, v := range arr {
+
+		arr[byte(v)] = -1
+	}
+
+	start := -1
+	max := 0
+
+	for i, v := range str {
+
+		if arr[byte(v)] > start {
+			start = arr[byte(v)]
+		}
+
+		if i-start > max {
+
+			max = i - start
+		}
+
+		arr[byte(v)] = i
+	}
+
+	return max
+
+}
+
+func main() {
+
+	str := "ab"
+	v := lengthOfLongestSubstring(str)
+
+	fmt.Printf("%s\n%d\n", str, v)
+
+}

003.Longest Substring Without Repeating Characters/Jimmy Xiang/003.go

@@ -0,0 +1,9 @@
+package main
+
+import (
+	"fmt"
+)
+
+func main() {
+
+}

004.Median of Two Sorted Arrays/Jimmy Xiang/004.go

@@ -4,4 +4,5 @@ There are two sorted arrays nums1 and nums2 of size m and n respectively.
 
 Find the median of the two sorted arrays.   
 
-The overall run time complexity should be O(log (m+n)).
+The overall run time complexity should be O(log (m+n)).
+

004.Median of Two Sorted Arrays/Median of Two Sorted Arrays.md

@@ -1,4 +1,4 @@
-bool isy(int x) {  
+bool isPalindrome(int x) {  
     int y = 0;  
     int origin = x;
     if (x < 0) return 0;

009.Palindrome Number/shadowcoder/PalindromeNum.c

@@ -28,9 +28,9 @@ char** generateParenthesis(int n, int* returnSize)
 	int left = n, right = n;
 	char line[1024] = {0};
 	int lp = 0;
-	char **result = (char **)calloc(sizeof(char *), 81920);
+	char **result = (char **)calloc(sizeof(char *), 8192);
 	int i;
-	for (i = 0; i < 81920; i++) 
+	for (i = 0; i < 8192; i++) 
 		result[i] = (char *)calloc(sizeof(char), n + 1);
 	*returnSize = 0;
 	fun(left, right, line, lp, result, returnSize);

022.Generate Parentheses/shadowcoder/parentheses.c

@@ -0,0 +1,33 @@
+package main
+
+import (
+	"fmt"
+)
+
+func removeDuplicate(arr []int) int {
+
+	if len(arr) == 0 {
+		return 0
+	}
+
+	num := 0
+
+	for _, value := range arr {
+		if value != arr[num] {
+			num += 1
+			arr[num] = value
+		}
+
+	}
+
+	return num + 1
+}
+
+func main() {
+
+	arr := []int{}
+	num := removeDuplicate(arr)
+
+	fmt.Println(arr[:num], num)
+
+}