add new files

Signed-off-by: megatontech <techme@live.cn>

Author: megatontech

AddNumbers.go

@@ -0,0 +1,65 @@
+package main
+
+import (
+	"fmt"
+)
+type ListNode struct {
+	Val int
+	Next *ListNode
+}
+func scanLinklist(p *ListNode){     // 形参p是Student型的指针，指针参数需要传入一个地址
+	for p != nil {
+		fmt.Println(*p)
+		p = p.Next      // 这是简写，标准写法是   p = (*p).next
+	}
+}
+//You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
+//
+//You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+//
+//Example:
+//
+//Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
+//Output: 7 -> 0 -> 8
+//Explanation: 342 + 465 = 807.
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
+Output: 7 -> 0 -> 8
+Explanation: 342 + 465 = 807.
+*/
+func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
+	var l3 =  ListNode{Val: 0, Next: nil}
+	var offset,count = 0,0
+	var lastNode = &l3
+	for (l1!=nil||l2!=nil||offset!=0) {
+		var temp01,temp02 = 0,0
+		if(l1!=nil){temp01=l1.Val}
+		if(l2!=nil){temp02=l2.Val}
+		currNode03:=ListNode {Val: 0, Next: nil}
+		currNode03.Val = (temp01+temp02)%10
+		if(count==0){
+			l3.Val = currNode03.Val
+			l3.Next = nil
+			lastNode = &l3
+		}else{
+			currNode03.Val = (currNode03.Val+offset)%10
+			lastNode.Next = &currNode03
+			lastNode = lastNode.Next
+		}
+		if((temp01+temp02+offset)>=10){
+			offset=1
+		}else{
+			offset=0
+		}
+		count++
+		if(l1!=nil){l1 = l1.Next}
+		if(l2!=nil){l2 = l2.Next}
+	}
+	return &l3
+}

app.yaml

@@ -0,0 +1,8 @@
+application: awesomeproject 
+version: 1
+runtime: go114
+api_version: go1
+
+handlers:
+- url: /.*
+  script: _go_app

awesomeproject.go

@@ -0,0 +1,20 @@
+package main
+
+import "fmt"
+
+func main() {
+	arr :=[]int  {3,2,4}
+	fmt.Println(twoSum01(arr,6))
+	var l104 =  ListNode{Val: 2, Next: nil}
+	var l103 =  ListNode{Val: 3, Next: &l104}
+	var l102 =  ListNode{Val: 4, Next: &l103}
+	var l101 =  ListNode{Val: 1, Next: &l102}
+	var l204 =  ListNode{Val: 3, Next: nil}
+	var l203 =  ListNode{Val: 4, Next: &l204}
+	var l202 =  ListNode{Val: 9, Next: &l203}
+	var l201 =  ListNode{Val: 9, Next: &l202}
+	scanLinklist(addTwoNumbers(&l101,&l201))
+	fmt.Println(lengthOfLongestSubstring("abdwiajfwaljwalgawfegsvg"))
+	fmt.Println(lengthOfLongestSubstring("abcabcaa"))
+
+}

lengthOfLongestSubstring.go

@@ -0,0 +1,54 @@
+package main
+
+//Longest Substring Without Repeating Characters
+//Medium
+//Given a string, find the length of the longest substring without repeating characters.
+//Example 1:
+//Input: "abcabcbb"
+//Output: 3
+//Explanation: The answer is "abc", with the length of 3.
+//Example 2:
+//Input: "bbbbb"
+//Output: 1
+//Explanation: The answer is "b", with the length of 1.
+//Example 3:
+//Input: "pwwkew"
+//Output: 3
+//Explanation: The answer is "wke", with the length of 3.
+//Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
+func lengthOfLongestSubstring(s string) int {
+	var max = 0
+	//var lenS = len(s)
+	//var arr = strings.Split(s,"")
+	//for index,cur :=range arr{
+	//	//var posi = getLatestPosi(arr[index:],arr[index])
+	//	//if(posi!=-1){
+	//	//
+	//	//}
+	//}
+	return max
+}
+//func getMaxSub(arr []rune , seek rune,count int) int{
+//	var max = 0
+//	for index,cur :=range arr{
+//		getMaxSub(arr[])
+//	}
+//	return max
+//}
+//func testContains(arr []rune,seek rune) bool{
+//	for index,cur :=range arr{
+//		if(arr[index]==seek){
+//			return true
+//		}
+//	}
+//	return false
+//
+//}
+//func getLatestPosi(arr []rune,seek rune) int{
+//	for index,cur :=range arr{
+//		if(arr[index]==seek){
+//			return index
+//		}
+//	}
+//	return -1
+//}

twoSum.go

@@ -0,0 +1,25 @@
+package main
+//Given an array of integers, return indices of the two numbers such that they add up to a specific target.
+//
+//You may assume that each input would have exactly one solution, and you may not use the same element twice.
+//
+//Example:
+//
+//Given nums = [2, 7, 11, 15], target = 9,
+//
+//Because nums[0] + nums[1] = 2 + 7 = 9,
+//return [0, 1].
+
+func twoSum01(nums []int, target int) []int {
+	var result []int = make([]int,2)
+	for i, i2 := range nums {
+		subnums := nums[i+1:]
+		for j, j2 := range subnums {
+			if(i2+j2==target){
+				result[0]=i
+				result[1]=j+i+1
+			}
+		}
+	}
+	return result
+}