├── .DS_Store
├── LeetCode-C++
    └── README.md
├── LeetCode-C
    └── README.md
├── LeetCode-Go
    ├── 01-两数之和.go
    ├── 03-无重复字符的最长子串.go
    ├── 04-寻找两个有序数组的中位数.go
    ├── 09-回文数.go
    ├── 13-罗马数字转整数.go
    ├── 14-最长公共前缀.go
    ├── 20-有效括号匹配.go
    ├── 21-合并单链表.go
    ├── 26-删除排序数组中的重复项.go
    ├── 27-移除元素.go
    ├── 28-实现strStr().go
    ├── 35-搜索插入位置.go
    ├── 38-报数.go
    └── 53-最大子序和.go
├── LeetCode-JavaScript
    ├── .idea
    │   ├── encodings.xml
    │   └── workspace.xml
    ├── 01-两数之和.js
    ├── 03-无重复字符的最长子串.js
    ├── 04-寻找两个有序数组的中位数.js
    ├── 09-回文数.js
    ├── 13-罗马数字转整数.js
    ├── 14-最长公共前缀.js
    ├── 20-有效括号匹配.js
    ├── 21-合并链表.js
    ├── 26-删除排序数组中的重复项.js
    ├── 27-移出元素.js
    ├── 28-实现strStr().js
    ├── 35-搜索插入位置.js
    ├── 38-报数.js
    └── 53-最大子序和.js
├── LeetCode-Python
    ├── .idea
    │   ├── encodings.xml
    │   ├── misc.xml
    │   ├── modules.xml
    │   ├── vcs.xml
    │   └── workspace.xml
    ├── 01-两数之和.py
    ├── 03-无重复字符的最长子串.py
    ├── 04-寻找两个有序数组的中位数.py
    ├── 09-回文数.py
    ├── 13-罗马数字转整数.py
    ├── 14-最长公共前缀.py
    ├── 20-有效括号匹配.py
    ├── 21-合并两个有序链表.py
    ├── 26-删除数据重复项.py
    ├── 27.移出元素.py
    ├── 28-实现strStr().py
    ├── 35-搜索插入位置.py
    ├── 38-报数.py
    ├── 53-最大子序和.py
    └── LeetCode-Python.iml
├── LeetCode-Rust
    ├── .idea
    │   ├── encodings.xml
    │   ├── misc.xml
    │   ├── modules.xml
    │   ├── vcs.xml
    │   └── workspace.xml
    ├── 01-两数之和.rs
    ├── 03-无重复字符的最长子串.rs
    ├── 04-寻找两个有序数组的中位数.rs
    ├── 09-回文数.rs
    ├── 13-罗马数字转整数.rs
    ├── 14-最长公共前缀.rs
    ├── 20-有效括号匹配.rs
    ├── 21-合并链表.rs
    ├── 26-删除排序数组中的重复项.rs
    ├── 27-移出元素.rs
    ├── 28-实现strStr().rs
    ├── 35. 搜索插入位置.rs
    ├── 38-报数.rs
    ├── 53-最大子序和.rs
    ├── Cargo.lock
    ├── Cargo.toml
    ├── LeetCode-Rust.iml
    ├── main.rs
    ├── target
    │   ├── .rustc_info.json
    │   └── debug
    │   │   ├── .cargo-lock
    │   │   ├── .fingerprint
    │   │       ├── LeetCode-Rust-2bf0bcc5ad83b5f0
    │   │       │   ├── dep-test-bin-LeetCode_Rust-2bf0bcc5ad83b5f0
    │   │       │   ├── test-bin-LeetCode_Rust-2bf0bcc5ad83b5f0
    │   │       │   └── test-bin-LeetCode_Rust-2bf0bcc5ad83b5f0.json
    │   │       └── LeetCode-Rust-5696fac0a517894e
    │   │       │   ├── bin-LeetCode_Rust-5696fac0a517894e
    │   │       │   ├── bin-LeetCode_Rust-5696fac0a517894e.json
    │   │       │   └── dep-bin-LeetCode_Rust-5696fac0a517894e
    │   │   ├── LeetCode-Rust
    │   │   ├── LeetCode-Rust.d
    │   │   ├── LeetCode-Rust.dSYM
    │   │   ├── LeetCode_Rust-2bf0bcc5ad83b5f0
    │   │   ├── LeetCode_Rust-2bf0bcc5ad83b5f0.d
    │   │   ├── LeetCode_Rust-2bf0bcc5ad83b5f0.dSYM
    │   │   ├── deps
    │   │       ├── LeetCode_Rust-2bf0bcc5ad83b5f0
    │   │       ├── LeetCode_Rust-2bf0bcc5ad83b5f0.d
    │   │       ├── LeetCode_Rust-2bf0bcc5ad83b5f0.dSYM
    │   │       │   └── Contents
    │   │       │   │   ├── Info.plist
    │   │       │   │   └── Resources
    │   │       │   │       └── DWARF
    │   │       │   │           └── LeetCode_Rust-2bf0bcc5ad83b5f0
    │   │       ├── LeetCode_Rust-5696fac0a517894e
    │   │       ├── LeetCode_Rust-5696fac0a517894e.d
    │   │       └── LeetCode_Rust-5696fac0a517894e.dSYM
    │   │       │   └── Contents
    │   │       │       ├── Info.plist
    │   │       │       └── Resources
    │   │       │           └── DWARF
    │   │       │               └── LeetCode_Rust-5696fac0a517894e
    │   │   └── incremental
    │   │       ├── LeetCode_Rust-2auf6cwtluyov
    │   │           ├── s-fb3jsmu571-4tkybo-1sfq6edueq5p6
    │   │           │   ├── 1256iturvpiv1n7i.o
    │   │           │   ├── 19vflewwuvfdyb97.o
    │   │           │   ├── 1hpmapa50f4kqihp.o
    │   │           │   ├── 1qr2d35gt48lb8vk.o
    │   │           │   ├── 1tmov6htizy23n3h.o
    │   │           │   ├── 1v84pgkv2ou998of.o
    │   │           │   ├── 1yuwmo2o68vakup9.o
    │   │           │   ├── 2hnjzrgu1qgeu1af.o
    │   │           │   ├── 2jjeu3fahuhf31m5.o
    │   │           │   ├── 2n0hmizvc9oyusyr.o
    │   │           │   ├── 2q2pvyd5khkc2v98.o
    │   │           │   ├── 2t7ckujg5pm65zzg.o
    │   │           │   ├── 2vb0zrxwthpagkha.o
    │   │           │   ├── 30sf65joyo9ekyvh.o
    │   │           │   ├── 32ft60g13yq61bfn.o
    │   │           │   ├── 3c4j3bzovrfkfnj7.o
    │   │           │   ├── 3ubxedi59h4aj5ik.o
    │   │           │   ├── 3y7a5vp8i9141cdo.o
    │   │           │   ├── 43tpj7d9f74u3m7s.o
    │   │           │   ├── 45jbvzczyfb0v8mo.o
    │   │           │   ├── 4hxn4sibq3kj76o2.o
    │   │           │   ├── 4oybkrngg9rz7wkt.o
    │   │           │   ├── 50kw8dwj90g4gief.o
    │   │           │   ├── 5352oilpo024mzuo.o
    │   │           │   ├── 59cgw6qj79r88ust.o
    │   │           │   ├── 6mo3offy3oruuqi.o
    │   │           │   ├── dep-graph.bin
    │   │           │   ├── fyd3jbjy8p2lfb.o
    │   │           │   ├── gd49v5639vi6dvf.o
    │   │           │   ├── k1sljs2szm4556m.o
    │   │           │   ├── query-cache.bin
    │   │           │   └── work-products.bin
    │   │           └── s-fb3jsmu571-4tkybo.lock
    │   │       └── LeetCode_Rust-3a9n2u9ikjo32
    │   │           ├── s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9
    │   │               ├── 10i5bcpefr9rnk22.o
    │   │               ├── 1c6qd64os1izg558.o
    │   │               ├── 1fi7s02l6wl1ota8.o
    │   │               ├── 1ijuv1nchdiogsul.o
    │   │               ├── 1obggas7cftsc295.o
    │   │               ├── 1um7ketxfi3690gc.o
    │   │               ├── 1vetoijszefce5pe.o
    │   │               ├── 1zm3gcsafwpeifm0.o
    │   │               ├── 20zs8e6t5oygyfvc.o
    │   │               ├── 2fva14yv6vv6lhbf.o
    │   │               ├── 2kh8jfux11jn5j1d.o
    │   │               ├── 30d1coo6djf60t4.o
    │   │               ├── 38yxf3rpc8erp76i.o
    │   │               ├── 3d84ytrwf4tec0v1.o
    │   │               ├── 3lquy9lpx2t3w7nd.o
    │   │               ├── 3nyuwdazorl9uyeh.o
    │   │               ├── 3t7prvmvr8g0cuby.o
    │   │               ├── 40dz9qdfh6hjf5t.o
    │   │               ├── 41yg71qaa2f0r27j.o
    │   │               ├── 495bts4nsh7o0v3w.o
    │   │               ├── 4axcjhv6s8rvws5x.o
    │   │               ├── 4i0rywn1n9svk1uo.o
    │   │               ├── 4i6iqk2m2bky6xwn.o
    │   │               ├── 4iokp1dw8go3t9ud.o
    │   │               ├── 4k83cct2kl4wvrkm.o
    │   │               ├── 4q1i1cxa13n5yx21.o
    │   │               ├── 4t6la84ch8tqrvuv.o
    │   │               ├── 4weea8nparm4jyip.o
    │   │               ├── 52shiljcujysc5cv.o
    │   │               ├── 54zjf4xv0lgeq215.o
    │   │               ├── 574vpbuownei11ix.o
    │   │               ├── 58o6l6pwzdjc7sm7.o
    │   │               ├── 5cbqghs96eyjmsg0.o
    │   │               ├── d40mtyu0665grui.o
    │   │               ├── dep-graph.bin
    │   │               ├── mnigp1b9erqn671.o
    │   │               ├── qp18q4cf2p8ql06.o
    │   │               ├── query-cache.bin
    │   │               ├── work-products.bin
    │   │               ├── wu0zsou8zdmbt47.o
    │   │               └── y3j5st0c8cpuy4e.o
    │   │           └── s-fayuvvym6j-1wj1oax.lock
    └── wasm.rs
└── README.md


/.DS_Store:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/.DS_Store


--------------------------------------------------------------------------------
/LeetCode-C++/README.md:
--------------------------------------------------------------------------------
1 | # leetCode
2 | Rust,Go,Python,JavaScript实现的leetCode,欢迎下载，学习
3 | 地址：https://blog.csdn.net/baihuaxiu123/article/category/8694093
4 | 


--------------------------------------------------------------------------------
/LeetCode-C/README.md:
--------------------------------------------------------------------------------
1 | # leetCode
2 | Rust,Go,Python,JavaScript实现的leetCode,欢迎下载，学习
3 | 地址：https://blog.csdn.net/baihuaxiu123/article/category/8694093
4 | 


--------------------------------------------------------------------------------
/LeetCode-Go/01-两数之和.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | func twoSum(nums []int, target int) []int {
 3 | 	var res = []int{-1,-2}
 4 | 	for i:=0;i<len(nums);i++ {
 5 | 		temp := target - nums[i]
 6 | 		for j:=i+1;j<len(nums);j++ {
 7 | 			if temp == nums[j]{
 8 | 				res[0]=j
 9 | 				res[1]=i
10 | 				return res
11 | 			}
12 | 		}
13 | 	}
14 | 	return  res
15 | }
16 | 
17 | 


--------------------------------------------------------------------------------
/LeetCode-Go/03-无重复字符的最长子串.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | 
 3 | import (
 4 | 	"fmt"
 5 | )
 6 | 
 7 | func main() {
 8 | 	fmt.Println(lengthOfLongestSubstring("abcabcbb"))
 9 | }
10 | func lengthOfLongestSubstring(s string) int {
11 | 	sum_str := []byte{}
12 | 	i := 0
13 | 	j := 0
14 | 	max := 0
15 | 	lens := len(s)
16 | 	for ;i < lens && j < lens; {
17 | 		if findIndex(s[j],sum_str) == -1 {
18 | 			sum_str = append(sum_str, s[j])
19 | 			j ++
20 | 		} else {
21 | 			i++
22 | 			j = i
23 | 			sum_str = []byte{}
24 | 		}
25 | 		if max < len(sum_str){
26 | 			max = len(sum_str)
27 | 		}
28 | 	}
29 | 	return  max
30 | }
31 | /**
32 | 查询在元素在切片的位置
33 | */
34 | func findIndex(key byte,s []byte) int{
35 | 	for i,value := range s {
36 | 		if value == key {
37 | 			return i
38 | 		}
39 | 	}
40 | 	return -1
41 | }
42 | 
43 | 
44 | 


--------------------------------------------------------------------------------
/LeetCode-Go/04-寻找两个有序数组的中位数.go:
--------------------------------------------------------------------------------
 1 | func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
 2 | 	//边界判断
 3 | 	nums_1 := nums1
 4 | 	nums_2 := nums2
 5 | 	len1 := len(nums1)
 6 | 	len2 := len(nums2)
 7 | 	if len1 == 0 {
 8 | 		if len2 == 1 {
 9 | 			return  float64(nums_2[0])
10 | 		} else {
11 | 			v := len2/2
12 | 			if len2 % 2 == 0{
13 | 				return  float64(nums_2[v-1]+nums_2[v])/2.0
14 | 			} else {
15 | 				return float64(nums_2[v])
16 | 			}
17 | 		}
18 | 	}
19 | 	if len2 == 0 {
20 | 		if len1 == 1 {
21 | 			return float64(nums_1[0])
22 | 		} else {
23 | 			v := len1/2
24 | 			if len1 % 2 == 0{
25 | 				return float64(nums_1[v-1]+nums_1[v]) / 2.0
26 | 			} else {
27 | 				return float64(nums_1[v])
28 | 			}
29 | 		}
30 | 	}
31 | 	len_sum := len1 + len2
32 | 	flag_s :=  0
33 | 	limit_c := 0
34 | 	if len_sum % 2 == 0 {
35 | 		flag_s = 2
36 | 		limit_c = len_sum / 2 + 1.0
37 | 	} else {
38 | 		flag_s = 1
39 | 		limit_c = len_sum / 2.0 + 1
40 | 	}
41 | 	times := 0
42 | 	ans := []int{}
43 | 
44 | 	for;times < limit_c;{
45 | 		l1 := len(nums_1)
46 | 		l2 := len(nums_2)
47 | 		fmt.Println("1->",nums_1,"2->",nums_2)
48 | 		if l1 != 0 && l2 != 0{
49 | 			if nums_1[0] > nums_2[0]{
50 | 				ans = append(ans, nums_2[0])
51 | 				nums_2 = nums_2[1:]
52 | 			} else {
53 | 				ans = append(ans, nums_1[0])
54 | 				nums_1 = nums_1[1:]
55 | 			}
56 | 		} else if l1 == 0 && l2 != 0 {
57 | 			ans = append(ans, nums_2[0])
58 | 			nums_2 = nums_2[1:]
59 | 		} else if l2 == 0 && l1 != 0 {
60 | 			ans = append(ans, nums_1[0])
61 | 			nums_1 = nums_1[1:]
62 | 		}
63 | 		times += 1
64 | 	}
65 | 	if flag_s == 1 {
66 | 		l := len(ans)
67 | 		return float64(ans[l-1])
68 | 	} else {
69 | 		l := len(ans)
70 | 		return float64((ans[l-1] + ans[l-2]))/2
71 | 	}
72 | }


--------------------------------------------------------------------------------
/LeetCode-Go/09-回文数.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | func isPalindrome(x int) bool {
 3 | 	if x < 0 {
 4 | 		return false;
 5 | 	}
 6 | 	sum := 0;
 7 | 	n := x;
 8 | 	for n != 0 {
 9 | 		sum = sum *10 + n%10;
10 | 		n /= 10;
11 | 	}
12 | 	if sum == x {
13 | 		return true;
14 | 	}
15 | 	return false
16 | }
17 | 
18 | 
19 | 
20 | 


--------------------------------------------------------------------------------
/LeetCode-Go/13-罗马数字转整数.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | func romanToInt(s string) int {
 3 | 	maps := make(map[string]int)
 4 | 	maps["I"] = 1
 5 | 	maps["V"] = 5
 6 | 	maps["X"] = 10
 7 | 	maps["L"] = 50
 8 | 	maps["C"] = 100
 9 | 	maps["D"] = 500
10 | 	maps["M"] = 1000
11 | 	res := int(0)
12 | 	for i := 0; i< len(s);i++ {
13 | 		if i < len(s)-1 && maps[string(s[i])] < maps[string(s[i+1])] {
14 | 			res -= maps[string(s[i])]
15 | 		} else {
16 | 			res += maps[string(s[i])]
17 | 		}
18 | 	}
19 | 	return res
20 | }
21 | 
22 | 


--------------------------------------------------------------------------------
/LeetCode-Go/14-最长公共前缀.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | func longestCommonPrefix(strs []string) string {
 3 | 	if len(strs) == 0 {
 4 | 		return ""
 5 | 	}
 6 | 	if len(strs) == 1 {
 7 | 		return strs[0]
 8 | 	}
 9 | 	temp := strs[0]
10 | 	res := ""
11 | 	for i:=0;i<len(temp);i++ {
12 | 		for j:=1;j<len(strs);j++ {
13 | 			if i == len(strs[j]) || temp[i] != strs[j][i] {
14 | 				return  res
15 | 			}
16 | 
17 | 		}
18 | 		res += string(temp[i]);
19 | 	}
20 | 	return res
21 | }
22 | 
23 | 


--------------------------------------------------------------------------------
/LeetCode-Go/20-有效括号匹配.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | 
 3 | func isValid(s string) bool {
 4 | 	stack := make([]byte, 0)
 5 | 	for _, v := range s {
 6 | 		if v == '[' || v == '(' || v == '{' {
 7 | 			stack = append(stack, byte(v))
 8 | 		} else {
 9 | 			if (len(stack) != 0 && match(stack[len(stack)-1], byte(v))) {
10 | 				stack = pop(stack)
11 | 				continue
12 | 			} else {
13 | 				return false
14 | 			}
15 | 		}
16 | 	}
17 | 
18 | 	if (len(stack) == 0) {
19 | 		return true
20 | 	} else {
21 | 		return false
22 | 	}
23 | }
24 | func match(left, right byte) bool {
25 | 	switch right {
26 | 	case ']':
27 | 		if left != '[' {
28 | 			return false
29 | 		}
30 | 	case ')':
31 | 		if left != '(' {
32 | 			return false
33 | 		}
34 | 	case '}':
35 | 		if left != '{' {
36 | 			return false
37 | 		}
38 | 	}
39 | 	return true
40 | }
41 | 
42 | func pop(stack []byte) []byte {
43 | 	return stack[:len(stack)-1]
44 | }
45 | 


--------------------------------------------------------------------------------
/LeetCode-Go/21-合并单链表.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | 
 3 | func main1() {
 4 | 
 5 | 
 6 | }
 7 | /**
 8 | strconv
 9 |  * Definition for singly-linked list.
10 |  * type ListNode struct {
11 |  *     Val int
12 |  *     Next *ListNode
13 |  * }
14 |  */
15 | type ListNode struct {
16 | 	Val int
17 | 	Next *ListNode
18 | }
19 | func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
20 | 	if l1 == nil {
21 | 		return  l2
22 | 	}
23 | 	if l2 == nil {
24 | 		return l1
25 | 	}
26 | 	var result *ListNode
27 | 	if l1.Val >= l2.Val {
28 | 		result = l2
29 | 		result.Next = mergeTwoLists(l1,l2.Next)
30 | 	}
31 | 	if l2.Val >= l1.Val {
32 | 		result = l1
33 | 		result.Next = mergeTwoLists(l1.Next,l2)
34 | 	}
35 | 	return result
36 | }
37 | 


--------------------------------------------------------------------------------
/LeetCode-Go/26-删除排序数组中的重复项.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | 
 3 | func main1() {
 4 | 
 5 | }
 6 | func removeDuplicates(nums []int) int {
 7 | 	if len(nums) < 2{
 8 | 		return len(nums)
 9 | 	}
10 | 	count := 0
11 | 	for i:=1;i<len(nums);i++{
12 | 		if nums[count] != nums[i]{
13 | 			count += 1
14 | 			nums[count] = nums[i]
15 | 		}
16 | 	}
17 | 	return count+1
18 | }
19 | 
20 | 


--------------------------------------------------------------------------------
/LeetCode-Go/27-移除元素.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | 
 3 | import "fmt"
 4 | 
 5 | func main1() {
 6 | l := removeElement([]int{3,2,2,3},3)
 7 |  fmt.Println(l)
 8 | }
 9 | func removeElement(nums []int, val int) int {
10 | 	if len(nums) == 0 {
11 | 		return 0
12 | 	}
13 | 	num := 0
14 | 	for i:=0;i<len(nums);i++{
15 | 		if nums[i] != val {
16 | 			nums[num] = nums[i]
17 | 			num ++
18 | 		}
19 | 	}
20 | 	return num
21 | }
22 | //func removeElement(nums []int, val int) int {
23 | //	if len(nums) == 0 {
24 | //		return 0
25 | //	}
26 | //	for i:=0;i<=len(nums)-1;{
27 | //		if nums[i] == val {
28 | //			nums = append(nums[:i],nums[i+1:]...)
29 | //		} else {
30 | //			i++
31 | //		}
32 | //	}
33 | //	fmt.Println(nums)
34 | //	return len(nums)
35 | //}
36 | 
37 | 
38 | 


--------------------------------------------------------------------------------
/LeetCode-Go/28-实现strStr().go:
--------------------------------------------------------------------------------
1 | package main
2 | 
3 | import "strings"
4 | func strStr(haystack string, needle string) int {
5 |   return strings.Index(haystack,needle)
6 | }
7 | 


--------------------------------------------------------------------------------
/LeetCode-Go/35-搜索插入位置.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | 
 3 | import "fmt"
 4 | 
 5 | func main() {
 6 |  a := []int{1,2,3,4,5,6}
 7 |  fmt.Println(searchInsert(a,5))
 8 | }
 9 | 
10 | func searchInsert(nums []int, target int) int {
11 | 	low := 0
12 | 	high := len(nums)
13 | 	for ;low<high; {
14 | 		mid := low + (high - low)/2
15 | 		if nums[mid] > target{
16 | 			high = mid
17 | 		} else if nums[mid] < target {
18 | 			low = mid + 1
19 | 		} else {
20 | 			return mid
21 | 		}
22 | 	}
23 | 	return low
24 | }
25 | 


--------------------------------------------------------------------------------
/LeetCode-Go/38-报数.go:
--------------------------------------------------------------------------------
 1 | func countAndSay(n int) string {
 2 | 	if n == 1 {
 3 | 		return "1"
 4 | 	} else {
 5 | 		str := countAndSay(n-1)
 6 | 		count := 1
 7 | 		res := ""
 8 | 		for i:=0;i<len(str);i++ {
 9 | 			if i+1<len(str)&&str[i]==str[i+1]{
10 | 				count ++
11 | 			} else {
12 | 			   res = res + strconv.Itoa(count)+string(str[i])
13 | 			   // 重置
14 | 			   count = 1
15 | 			}
16 | 		}
17 | 		return res
18 | 	}
19 | }


--------------------------------------------------------------------------------
/LeetCode-Go/53-最大子序和.go:
--------------------------------------------------------------------------------
 1 | package main
 2 | 
 3 | import "fmt"
 4 | 
 5 | func main() {
 6 |  fmt.Println(maxSubArray([]int{-2,1,-3,4,-1,2,1,-5,4}))
 7 | }
 8 | func maxSubArray(nums []int) int {
 9 | 	sum := 0
10 | 	max_sum := nums[0]
11 | 	for i:=0;i < len(nums); i++ {
12 | 		if sum < 0{
13 | 			sum = nums[i]
14 | 		} else {
15 | 			sum += nums[i]
16 | 		}
17 | 		if sum > max_sum{
18 | 			max_sum = sum
19 | 		}
20 | 	}
21 | 	return max_sum
22 | }
23 | 
24 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/.idea/encodings.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <project version="4">
3 |   <component name="Encoding" addBOMForNewFiles="with NO BOM" />
4 | </project>


--------------------------------------------------------------------------------
/LeetCode-JavaScript/.idea/workspace.xml:
--------------------------------------------------------------------------------
  1 | <?xml version="1.0" encoding="UTF-8"?>
  2 | <project version="4">
  3 |   <component name="ChangeListManager">
  4 |     <list default="true" id="96604129-3fab-4eb8-a303-673431268569" name="Default Changelist" comment="" />
  5 |     <option name="EXCLUDED_CONVERTED_TO_IGNORED" value="true" />
  6 |     <option name="SHOW_DIALOG" value="false" />
  7 |     <option name="HIGHLIGHT_CONFLICTS" value="true" />
  8 |     <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
  9 |     <option name="LAST_RESOLUTION" value="IGNORE" />
 10 |   </component>
 11 |   <component name="FileEditorManager">
 12 |     <leaf SIDE_TABS_SIZE_LIMIT_KEY="300">
 13 |       <file pinned="false" current-in-tab="false">
 14 |         <entry file="file://$PROJECT_DIR$/38-报数.js">
 15 |           <provider selected="true" editor-type-id="text-editor">
 16 |             <state relative-caret-position="186">
 17 |               <caret line="6" column="17" selection-start-line="6" selection-start-column="17" selection-end-line="6" selection-end-column="17" />
 18 |             </state>
 19 |           </provider>
 20 |         </entry>
 21 |       </file>
 22 |       <file pinned="false" current-in-tab="false">
 23 |         <entry file="file://$PROJECT_DIR$/35-搜索插入位置.js">
 24 |           <provider selected="true" editor-type-id="text-editor" />
 25 |         </entry>
 26 |       </file>
 27 |       <file pinned="false" current-in-tab="false">
 28 |         <entry file="file://$PROJECT_DIR$/28-实现strStr().js">
 29 |           <provider selected="true" editor-type-id="text-editor" />
 30 |         </entry>
 31 |       </file>
 32 |       <file pinned="false" current-in-tab="false">
 33 |         <entry file="file://$PROJECT_DIR$/03-无重复字符的最长子串.js">
 34 |           <provider selected="true" editor-type-id="text-editor">
 35 |             <state relative-caret-position="341">
 36 |               <caret line="11" column="12" selection-start-line="11" selection-start-column="12" selection-end-line="11" selection-end-column="12" />
 37 |             </state>
 38 |           </provider>
 39 |         </entry>
 40 |       </file>
 41 |       <file pinned="false" current-in-tab="true">
 42 |         <entry file="file://$PROJECT_DIR$/04-寻找两个有序数组的中位数.js">
 43 |           <provider selected="true" editor-type-id="text-editor">
 44 |             <state relative-caret-position="-180">
 45 |               <caret line="7" column="9" lean-forward="true" selection-start-line="7" selection-start-column="9" selection-end-line="7" selection-end-column="9" />
 46 |             </state>
 47 |           </provider>
 48 |         </entry>
 49 |       </file>
 50 |       <file pinned="false" current-in-tab="false">
 51 |         <entry file="file://$APPLICATION_HOME_DIR$/plugins/JavaScriptLanguage/jsLanguageServicesImpl/external/lib.es5.d.ts">
 52 |           <provider selected="true" editor-type-id="text-editor">
 53 |             <state relative-caret-position="31">
 54 |               <caret line="1210" column="4" selection-start-line="1210" selection-start-column="4" selection-end-line="1210" selection-end-column="4" />
 55 |             </state>
 56 |           </provider>
 57 |         </entry>
 58 |       </file>
 59 |     </leaf>
 60 |   </component>
 61 |   <component name="IdeDocumentHistory">
 62 |     <option name="CHANGED_PATHS">
 63 |       <list>
 64 |         <option value="$PROJECT_DIR$/03-无重复字符的最长子串.js" />
 65 |         <option value="$PROJECT_DIR$/04-寻找两个有序数组的中位数.js" />
 66 |       </list>
 67 |     </option>
 68 |   </component>
 69 |   <component name="ProjectFrameBounds" extendedState="6">
 70 |     <option name="x" value="1573" />
 71 |     <option name="y" value="95" />
 72 |     <option name="width" value="1280" />
 73 |     <option name="height" value="737" />
 74 |   </component>
 75 |   <component name="ProjectView">
 76 |     <navigator proportions="" version="1">
 77 |       <foldersAlwaysOnTop value="true" />
 78 |     </navigator>
 79 |     <panes>
 80 |       <pane id="ProjectPane" />
 81 |       <pane id="Scope" />
 82 |       <pane id="PackagesPane" />
 83 |     </panes>
 84 |   </component>
 85 |   <component name="PropertiesComponent">
 86 |     <property name="go.gopath.indexing.explicitly.defined" value="true" />
 87 |     <property name="last_opened_file_path" value="$PROJECT_DIR$" />
 88 |     <property name="nodejs_interpreter_path.stuck_in_default_project" value="undefined stuck path" />
 89 |     <property name="nodejs_npm_path_reset_for_default_project" value="true" />
 90 |     <property name="project.structure.last.edited" value="Modules" />
 91 |     <property name="project.structure.proportion" value="0.0" />
 92 |     <property name="project.structure.side.proportion" value="0.0" />
 93 |     <property name="settings.editor.selected.configurable" value="preferences.pluginManager" />
 94 |   </component>
 95 |   <component name="RunDashboard">
 96 |     <option name="ruleStates">
 97 |       <list>
 98 |         <RuleState>
 99 |           <option name="name" value="ConfigurationTypeDashboardGroupingRule" />
100 |         </RuleState>
101 |         <RuleState>
102 |           <option name="name" value="StatusDashboardGroupingRule" />
103 |         </RuleState>
104 |       </list>
105 |     </option>
106 |   </component>
107 |   <component name="RunManager" selected="Node.js.04-寻找两个有序数组的中位数.js">
108 |     <configuration name="03-无重复字符的最长子串.js" type="NodeJSConfigurationType" temporary="true" nameIsGenerated="true" path-to-js-file="$PROJECT_DIR$/03-无重复字符的最长子串.js" working-dir="$PROJECT_DIR$">
109 |       <method v="2" />
110 |     </configuration>
111 |     <configuration name="04-寻找两个有序数组的中位数.js" type="NodeJSConfigurationType" temporary="true" nameIsGenerated="true" path-to-js-file="$PROJECT_DIR$/04-寻找两个有序数组的中位数.js" working-dir="$PROJECT_DIR$">
112 |       <method v="2" />
113 |     </configuration>
114 |     <configuration name="38-报数.js" type="NodeJSConfigurationType" temporary="true" nameIsGenerated="true" path-to-js-file="$PROJECT_DIR$/38-报数.js" working-dir="$PROJECT_DIR$">
115 |       <method v="2" />
116 |     </configuration>
117 |     <recent_temporary>
118 |       <list>
119 |         <item itemvalue="Node.js.04-寻找两个有序数组的中位数.js" />
120 |         <item itemvalue="Node.js.03-无重复字符的最长子串.js" />
121 |         <item itemvalue="Node.js.38-报数.js" />
122 |       </list>
123 |     </recent_temporary>
124 |   </component>
125 |   <component name="ToolWindowManager">
126 |     <frame x="1280" y="23" width="1920" height="1057" extended-state="6" />
127 |     <editor active="true" />
128 |     <layout>
129 |       <window_info content_ui="combo" id="Project" order="0" visible="true" weight="0.13471779" />
130 |       <window_info id="Structure" order="1" side_tool="true" weight="0.25" />
131 |       <window_info id="Designer" order="2" />
132 |       <window_info id="Favorites" order="3" side_tool="true" />
133 |       <window_info anchor="bottom" id="Message" order="0" />
134 |       <window_info anchor="bottom" id="Find" order="1" />
135 |       <window_info active="true" anchor="bottom" id="Run" order="2" visible="true" weight="0.17895879" />
136 |       <window_info anchor="bottom" id="Debug" order="3" weight="0.4" />
137 |       <window_info anchor="bottom" id="Cvs" order="4" weight="0.25" />
138 |       <window_info anchor="bottom" id="Inspection" order="5" weight="0.4" />
139 |       <window_info anchor="bottom" id="TODO" order="6" />
140 |       <window_info anchor="bottom" id="LuaCheck" order="7" />
141 |       <window_info anchor="bottom" id="Version Control" order="8" />
142 |       <window_info anchor="bottom" id="Database Changes" order="9" />
143 |       <window_info anchor="bottom" id="Terminal" order="10" weight="0.32890365" />
144 |       <window_info anchor="bottom" id="Event Log" order="11" side_tool="true" />
145 |       <window_info anchor="right" id="Commander" internal_type="SLIDING" order="0" type="SLIDING" weight="0.4" />
146 |       <window_info anchor="right" id="Ant Build" order="1" weight="0.25" />
147 |       <window_info anchor="right" content_ui="combo" id="Hierarchy" order="2" weight="0.25" />
148 |       <window_info anchor="right" id="Cargo" order="3" />
149 |       <window_info anchor="right" id="Database" order="4" />
150 |       <window_info anchor="right" id="Palette&#9;" order="5" />
151 |       <window_info anchor="right" id="SciView" order="6" />
152 |       <window_info anchor="right" id="Json Parser" order="7" />
153 |     </layout>
154 |   </component>
155 |   <component name="TypeScriptGeneratedFilesManager">
156 |     <option name="version" value="1" />
157 |   </component>
158 |   <component name="editorHistoryManager">
159 |     <entry file="file://$PROJECT_DIR$/38-报数.js">
160 |       <provider selected="true" editor-type-id="text-editor">
161 |         <state relative-caret-position="186">
162 |           <caret line="6" column="17" selection-start-line="6" selection-start-column="17" selection-end-line="6" selection-end-column="17" />
163 |         </state>
164 |       </provider>
165 |     </entry>
166 |     <entry file="file://$PROJECT_DIR$/35-搜索插入位置.js">
167 |       <provider selected="true" editor-type-id="text-editor" />
168 |     </entry>
169 |     <entry file="file://$PROJECT_DIR$/28-实现strStr().js">
170 |       <provider selected="true" editor-type-id="text-editor" />
171 |     </entry>
172 |     <entry file="file://$PROJECT_DIR$/03-无重复字符的最长子串.js">
173 |       <provider selected="true" editor-type-id="text-editor">
174 |         <state relative-caret-position="341">
175 |           <caret line="11" column="12" selection-start-line="11" selection-start-column="12" selection-end-line="11" selection-end-column="12" />
176 |         </state>
177 |       </provider>
178 |     </entry>
179 |     <entry file="file://$APPLICATION_HOME_DIR$/plugins/JavaScriptLanguage/jsLanguageServicesImpl/external/lib.es5.d.ts">
180 |       <provider selected="true" editor-type-id="text-editor">
181 |         <state relative-caret-position="31">
182 |           <caret line="1210" column="4" selection-start-line="1210" selection-start-column="4" selection-end-line="1210" selection-end-column="4" />
183 |         </state>
184 |       </provider>
185 |     </entry>
186 |     <entry file="file://$PROJECT_DIR$/04-寻找两个有序数组的中位数.js">
187 |       <provider selected="true" editor-type-id="text-editor">
188 |         <state relative-caret-position="-180">
189 |           <caret line="7" column="9" lean-forward="true" selection-start-line="7" selection-start-column="9" selection-end-line="7" selection-end-column="9" />
190 |         </state>
191 |       </provider>
192 |     </entry>
193 |   </component>
194 |   <component name="masterDetails">
195 |     <states>
196 |       <state key="ArtifactsStructureConfigurable.UI">
197 |         <settings>
198 |           <artifact-editor />
199 |           <splitter-proportions>
200 |             <option name="proportions">
201 |               <list>
202 |                 <option value="0.2" />
203 |               </list>
204 |             </option>
205 |           </splitter-proportions>
206 |         </settings>
207 |       </state>
208 |       <state key="FacetStructureConfigurable.UI">
209 |         <settings>
210 |           <last-edited>No facets are configured</last-edited>
211 |           <splitter-proportions>
212 |             <option name="proportions">
213 |               <list>
214 |                 <option value="0.2" />
215 |               </list>
216 |             </option>
217 |           </splitter-proportions>
218 |         </settings>
219 |       </state>
220 |       <state key="GlobalLibrariesConfigurable.UI">
221 |         <settings>
222 |           <last-edited>Python 3.6 (LeetCode-JavaScript) (2) interpreter library</last-edited>
223 |           <splitter-proportions>
224 |             <option name="proportions">
225 |               <list>
226 |                 <option value="0.2" />
227 |               </list>
228 |             </option>
229 |           </splitter-proportions>
230 |         </settings>
231 |       </state>
232 |       <state key="JdkListConfigurable.UI">
233 |         <settings>
234 |           <last-edited>1.8</last-edited>
235 |           <splitter-proportions>
236 |             <option name="proportions">
237 |               <list>
238 |                 <option value="0.2" />
239 |               </list>
240 |             </option>
241 |           </splitter-proportions>
242 |         </settings>
243 |       </state>
244 |       <state key="ModuleStructureConfigurable.UI">
245 |         <settings>
246 |           <splitter-proportions>
247 |             <option name="proportions">
248 |               <list>
249 |                 <option value="0.2" />
250 |               </list>
251 |             </option>
252 |           </splitter-proportions>
253 |         </settings>
254 |       </state>
255 |       <state key="ProjectLibrariesConfigurable.UI">
256 |         <settings>
257 |           <splitter-proportions>
258 |             <option name="proportions">
259 |               <list>
260 |                 <option value="0.2" />
261 |               </list>
262 |             </option>
263 |           </splitter-proportions>
264 |         </settings>
265 |       </state>
266 |     </states>
267 |   </component>
268 | </project>


--------------------------------------------------------------------------------
/LeetCode-JavaScript/01-两数之和.js:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * @param {number[]} nums
 3 |  * @param {number} target
 4 |  * @return {number[]}
 5 |  */
 6 | var twoSum = function(nums, target) {
 7 |     for(let i = 0;i<nums.length;i++){
 8 |         for(let j=i+1;j<nums.length;j++){
 9 |             if(nums[i] + nums[j] === target){
10 |             return [i,j];
11 |             }
12 |         }
13 |     }
14 | };
15 | 
16 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/03-无重复字符的最长子串.js:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * @param {string} s
 3 |  * @return {number}
 4 |  */
 5 | var lengthOfLongestSubstring = function (s) {
 6 |   var sum = "";
 7 |   var max = 0;
 8 |   var i = 0;
 9 |   var k = i;
10 |   while (i < s.length && k < s.length) {
11 |     if (sum.indexOf(s[k]) === -1) {
12 |       sum += s[k];
13 |       k++;
14 |     } else {
15 |       i++;
16 |       k = i;
17 |       sum = "";
18 |     }
19 |     max = Math.max(max, sum.length);
20 |   }
21 |   return max;
22 | };
23 | let res = lengthOfLongestSubstring("abcag")
24 | console.log(res)
25 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/04-寻找两个有序数组的中位数.js:
--------------------------------------------------------------------------------
 1 | var findMedianSortedArrays = function (nums1, nums2) {
 2 |     let nums_1 = nums1
 3 |     let nums_2 = nums2
 4 |     // 计算长度
 5 |     let len1 = nums_1.length
 6 |     let len2 = nums_2.length
 7 |     let arr2_c = 0
 8 |   // 边界判断
 9 |   if(len1==0) {
10 |      if (len2 == 1) {
11 |          arr2_c = nums_2[0]
12 |      } else {
13 |          let v = parseInt(len2/2)
14 |          if(len2%2 == 1) {
15 |              arr2_c = nums_2[v]
16 |          } else {
17 |              arr2_c = (nums_2[v-1] + nums_2[v])/2.0
18 |          }
19 |        return arr2_c
20 |      }
21 |    }
22 |   if (len2 == 0) {
23 |       if (len1 == 1) {
24 |           arr2_c = nums_1[0]
25 |       } else {
26 |           let v = parseInt(len1/2)
27 |           if(len1%2 == 1) {
28 |               arr2_c = nums_1[v]
29 |           } else {
30 |               arr2_c = (nums_1[v-1] + nums_1[v])/2.0
31 |           }
32 |       }
33 |       return arr2_c
34 |   }
35 |   let len_sum = len2 + len1
36 |   let flag = 0
37 |   let limit = 0
38 |   if (len_sum%2==0) {
39 |      flag = 2
40 |       limit = len_sum / 2 + 1
41 |   } else {
42 |       flag = 1
43 |       limit = len_sum / 2
44 | 
45 |   }
46 |   let times = 0
47 |     let ans = []
48 |     while (times < limit) {
49 |       let l1 = nums_1.length
50 |       let l2 = nums_2.length
51 |       if (l1 !==0 && l2!==0 ) {
52 |           if (nums_1[0] > nums_2[0]){
53 |               let v = nums_2.shift()
54 |               ans.push(v)
55 |           } else {
56 |               let v = nums_1.shift()
57 |               ans.push(v)
58 |           }
59 |       } else if (l1 == 0 && l2 !== 0){
60 |           ans.push(nums_2.shift())
61 |       } else if (l2 == 0 && l1 !== 0) {
62 |           ans.push(nums_1.shift())
63 |       }
64 |         times ++
65 |     }
66 |   if (flag == 1) {
67 |       return ans.pop()
68 |   } else {
69 |       return (ans.pop() + ans.pop())/2
70 |   }
71 | };
72 | 
73 | a = findMedianSortedArrays([2],[])
74 | console.log(a)
75 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/09-回文数.js:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * @param {number} x
 3 |  * @return {boolean}
 4 |  */
 5 | var isPalindrome = function(x) {
 6 |      if (x < 0) {
 7 |         return false;
 8 |     }
 9 |     var sum = 0;
10 |     var n = x;
11 |     while (n != 0) {
12 |         sum = sum *10 + n%10;
13 |         n /= 10;
14 |         n = Math.floor(n)
15 |     }
16 |     if (sum == x) {
17 |         return true;
18 |     }
19 |     return false 
20 | };
21 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/13-罗马数字转整数.js:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * @param {string} s
 3 |  * @return {number}
 4 |  */
 5 | var romanToInt = function(s) {
 6 |     let maps = {"I":1,"V":5,"X":10,"L":50,"C":100,"D":500,"M":1000};
 7 |     let res = 0
 8 |     for (let i = 0;i < s.length;i++ ){
 9 |         if ((i < s.length -1)&&(maps[s[i]] < maps[s[i + 1]])){
10 |            res -= maps[s[i]]
11 |         } else {
12 |           res += maps[s[i]] 
13 |         }
14 |     }
15 |     return res
16 | };
17 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/14-最长公共前缀.js:
--------------------------------------------------------------------------------
 1 | var longestCommonPrefix = function (strs) {
 2 |   if (strs.length == 0) return "";
 3 |   if (strs.length == 1) return strs[0];
 4 |   var temp = strs[0];
 5 |   var res = "";
 6 |   for (let i = 0; i < temp.length; i++) {
 7 |     for (let j = 1; j < strs.length; j++) {
 8 |       if (temp[i] !== strs[j][i]) {
 9 |         return res;
10 |       }
11 |     }
12 |     res += temp[i];
13 |   }
14 |   return res
15 | }
16 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/20-有效括号匹配.js:
--------------------------------------------------------------------------------
 1 | var isValid = function(s) {
 2 |     if(s == null||s.length <1){
 3 |         return true;
 4 |     }
 5 |     var stack = [];
 6 |     for(var i=0;i<s.length;i++){
 7 |         if(s[i] == ""){
 8 |             continue;
 9 |         }
10 |         if(stack.leng<1){
11 |             stack.push(s[i]);
12 |         }else if(stack[stack.length-1]=="("&&s[i]==")" ||stack[stack.length-1]=="{"&&s[i]=="}" ||stack[stack.length-1]=="["&&s[i]=="]"){
13 |             stack.pop();
14 |         }else{
15 |             stack.push(s[i]);
16 |         }
17 |     }
18 |     return stack.length<1;
19 | };
20 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/21-合并链表.js:
--------------------------------------------------------------------------------
 1 | function ListNode(val) {
 2 |     this.val = val;
 3 |     this.next = null;
 4 | }
 5 | var mergeTwoLists = function(l1, l2) {
 6 |     if (l1 == null) {
 7 |         return l2
 8 |     }
 9 |     if (l2 == null) {
10 |         return l1
11 |     }
12 |     var result = ListNode(null);
13 |     if (l1.val >= l2.val) {
14 |         result = l2
15 |         result.next = mergeTwoLists(l1,l2.next)
16 |     } else {
17 |         result = l1
18 |         result.next = mergeTwoLists(l1.next,l2)
19 |     }
20 |     return result
21 | };
22 | 
23 | 
24 | 
25 | 


--------------------------------------------------------------------------------
/LeetCode-JavaScript/26-删除排序数组中的重复项.js:
--------------------------------------------------------------------------------
 1 | var removeDuplicates = function(nums) {
 2 |     if (nums.length < 2) {
 3 |         return nums.length
 4 |     }
 5 |     var  count = 0
 6 |     for (let i = 1;i < nums.length;i++) {
 7 |         if (nums[count] !== nums[i]) {
 8 |             count += 1
 9 |             nums[count] = nums[i]
10 |         }
11 |     }
12 |     return count + 1
13 | };


--------------------------------------------------------------------------------
/LeetCode-JavaScript/27-移出元素.js:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * @param {number[]} nums
 3 |  * @param {number} val
 4 |  * @return {number}
 5 |  */
 6 | var removeElement = function(nums, val) {
 7 |     if(nums.length == 0) {
 8 |         return 0
 9 |     }
10 |     num = 0
11 |     for (let i = 0;i < nums.length;i++) {
12 |         if (nums[i] !== val) {
13 |             nums[nums] = nums[i]
14 |             nums++
15 |         }
16 |     }
17 |     return nums
18 | 
19 | };


--------------------------------------------------------------------------------
/LeetCode-JavaScript/28-实现strStr().js:
--------------------------------------------------------------------------------
1 | /**
2 |  * @param {string} haystack
3 |  * @param {string} needle
4 |  * @return {number}
5 |  */
6 | var strStr = function(haystack, needle) {
7 |    return haystack.indexOf(needle)
8 | };


--------------------------------------------------------------------------------
/LeetCode-JavaScript/35-搜索插入位置.js:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * @param {number[]} nums
 3 |  * @param {number} target
 4 |  * @return {number}
 5 |  */
 6 | var searchInsert = function(nums, target) {
 7 |     let low = 0
 8 |     let high = nums.length
 9 |     while (low < high){
10 |         let mid = parseInt(low + (high-low)/2)
11 |         if (nums[mid] < target){
12 |             low = mid +1
13 |         } else if (nums[mid] > target){
14 |             high = mid
15 |         } else {
16 |             return mid
17 |         }
18 |     }
19 |     return low
20 | };


--------------------------------------------------------------------------------
/LeetCode-JavaScript/38-报数.js:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * @param {number} n
 3 |  * @return {string}
 4 |  */
 5 | var countAndSay = function(n) {
 6 |    if(n == 1) {
 7 |        return "1"
 8 |    } else {
 9 |        let str = countAndSay(n-1);
10 |        let count = 1;
11 |        let res = "";
12 |        for (let i = 0;i < str.length;i++) {
13 |            if (str[i] == str[i+1]) {
14 |                count ++
15 |            } else {
16 |                res = res+count + str[i]
17 |                count = 1
18 |            }
19 |        }
20 |        return res
21 |    }
22 | };


--------------------------------------------------------------------------------
/LeetCode-JavaScript/53-最大子序和.js:
--------------------------------------------------------------------------------
 1 | /**
 2 |  * @param {number[]} nums
 3 |  * @return {number}
 4 |  */
 5 | var maxSubArray = function(nums) {
 6 |     let sum = 0
 7 |     let max_sum = nums[0]
 8 |     for (let i = 0;i < nums.length;i++) {
 9 |         if (sum < 0) {
10 |             sum = nums[i]
11 |         } else {
12 |             sum += nums[i]
13 |         }
14 |         if (sum > max_sum) {
15 |             max_sum = sum
16 |         }
17 |     }
18 |     return max_sum
19 | };


--------------------------------------------------------------------------------
/LeetCode-Python/.idea/encodings.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <project version="4">
3 |   <component name="Encoding" addBOMForNewFiles="with NO BOM" />
4 | </project>


--------------------------------------------------------------------------------
/LeetCode-Python/.idea/misc.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <project version="4">
3 |   <component name="ProjectRootManager" version="2" project-jdk-name="Python 3.6 (test)" project-jdk-type="Python SDK" />
4 | </project>


--------------------------------------------------------------------------------
/LeetCode-Python/.idea/modules.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <project version="4">
3 |   <component name="ProjectModuleManager">
4 |     <modules>
5 |       <module fileurl="file://$PROJECT_DIR$/LeetCode-Python.iml" filepath="$PROJECT_DIR$/LeetCode-Python.iml" />
6 |     </modules>
7 |   </component>
8 | </project>


--------------------------------------------------------------------------------
/LeetCode-Python/.idea/vcs.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <project version="4">
3 |   <component name="VcsDirectoryMappings">
4 |     <mapping directory="$PROJECT_DIR$/.." vcs="Git" />
5 |   </component>
6 | </project>


--------------------------------------------------------------------------------
/LeetCode-Python/.idea/workspace.xml:
--------------------------------------------------------------------------------
  1 | <?xml version="1.0" encoding="UTF-8"?>
  2 | <project version="4">
  3 |   <component name="ChangeListManager">
  4 |     <list default="true" id="f5a34b77-8e33-4c7f-8e39-e761c5cf464e" name="Default Changelist" comment="">
  5 |       <change afterPath="$PROJECT_DIR$/.idea/vcs.xml" afterDir="false" />
  6 |       <change beforePath="$PROJECT_DIR$/.idea/Python_pro.iml" beforeDir="false" />
  7 |       <change beforePath="$PROJECT_DIR$/.idea/misc.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/misc.xml" afterDir="false" />
  8 |       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
  9 |       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
 10 |     </list>
 11 |     <ignored path="$PROJECT_DIR$/out/" />
 12 |     <option name="EXCLUDED_CONVERTED_TO_IGNORED" value="true" />
 13 |     <option name="SHOW_DIALOG" value="false" />
 14 |     <option name="HIGHLIGHT_CONFLICTS" value="true" />
 15 |     <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
 16 |     <option name="LAST_RESOLUTION" value="IGNORE" />
 17 |   </component>
 18 |   <component name="FileEditorManager">
 19 |     <leaf SIDE_TABS_SIZE_LIMIT_KEY="300">
 20 |       <file pinned="false" current-in-tab="true">
 21 |         <entry file="file://$PROJECT_DIR$/01-两数之和.py">
 22 |           <provider selected="true" editor-type-id="text-editor">
 23 |             <state relative-caret-position="248">
 24 |               <caret line="12" column="6" lean-forward="true" selection-start-line="12" selection-start-column="6" selection-end-line="12" selection-end-column="6" />
 25 |             </state>
 26 |           </provider>
 27 |         </entry>
 28 |       </file>
 29 |     </leaf>
 30 |   </component>
 31 |   <component name="Git.Settings">
 32 |     <option name="RECENT_GIT_ROOT_PATH" value="$PROJECT_DIR$/.." />
 33 |   </component>
 34 |   <component name="ProjectFrameBounds" extendedState="6">
 35 |     <option name="x" value="1280" />
 36 |     <option name="y" value="23" />
 37 |     <option name="width" value="1920" />
 38 |     <option name="height" value="1057" />
 39 |   </component>
 40 |   <component name="ProjectLevelVcsManager" settingsEditedManually="true" />
 41 |   <component name="ProjectView">
 42 |     <navigator proportions="" version="1">
 43 |       <foldersAlwaysOnTop value="true" />
 44 |     </navigator>
 45 |     <panes>
 46 |       <pane id="Scope" />
 47 |       <pane id="ProjectPane">
 48 |         <subPane>
 49 |           <expand>
 50 |             <path>
 51 |               <item name="LeetCode-Python" type="b2602c69:ProjectViewProjectNode" />
 52 |               <item name="LeetCode-Python" type="462c0819:PsiDirectoryNode" />
 53 |             </path>
 54 |           </expand>
 55 |           <select />
 56 |         </subPane>
 57 |       </pane>
 58 |       <pane id="PackagesPane" />
 59 |     </panes>
 60 |   </component>
 61 |   <component name="PropertiesComponent">
 62 |     <property name="WebServerToolWindowFactoryState" value="false" />
 63 |     <property name="go.gopath.indexing.explicitly.defined" value="true" />
 64 |     <property name="nodejs_interpreter_path.stuck_in_default_project" value="undefined stuck path" />
 65 |     <property name="nodejs_npm_path_reset_for_default_project" value="true" />
 66 |     <property name="settings.editor.selected.configurable" value="com.jetbrains.python.configuration.PyActiveSdkModuleConfigurable" />
 67 |   </component>
 68 |   <component name="RunDashboard">
 69 |     <option name="ruleStates">
 70 |       <list>
 71 |         <RuleState>
 72 |           <option name="name" value="ConfigurationTypeDashboardGroupingRule" />
 73 |         </RuleState>
 74 |         <RuleState>
 75 |           <option name="name" value="StatusDashboardGroupingRule" />
 76 |         </RuleState>
 77 |       </list>
 78 |     </option>
 79 |   </component>
 80 |   <component name="SvnConfiguration">
 81 |     <configuration />
 82 |   </component>
 83 |   <component name="TaskManager">
 84 |     <task active="true" id="Default" summary="Default task">
 85 |       <changelist id="f5a34b77-8e33-4c7f-8e39-e761c5cf464e" name="Default Changelist" comment="" />
 86 |       <created>1553572343471</created>
 87 |       <option name="number" value="Default" />
 88 |       <option name="presentableId" value="Default" />
 89 |       <updated>1553572343471</updated>
 90 |       <workItem from="1553572345630" duration="47000" />
 91 |       <workItem from="1553572397808" duration="1606000" />
 92 |     </task>
 93 |     <servers />
 94 |   </component>
 95 |   <component name="TimeTrackingManager">
 96 |     <option name="totallyTimeSpent" value="1653000" />
 97 |   </component>
 98 |   <component name="ToolWindowManager">
 99 |     <frame x="1290" y="23" width="1920" height="1057" extended-state="6" />
100 |     <editor active="true" />
101 |     <layout>
102 |       <window_info content_ui="combo" id="Project" order="0" visible="true" weight="0.2553305" />
103 |       <window_info id="Structure" order="1" side_tool="true" weight="0.25" />
104 |       <window_info id="Designer" order="2" />
105 |       <window_info id="Favorites" order="3" side_tool="true" />
106 |       <window_info anchor="bottom" id="Message" order="0" />
107 |       <window_info anchor="bottom" id="Find" order="1" />
108 |       <window_info anchor="bottom" id="Run" order="2" />
109 |       <window_info anchor="bottom" id="Debug" order="3" weight="0.4" />
110 |       <window_info anchor="bottom" id="Cvs" order="4" weight="0.25" />
111 |       <window_info anchor="bottom" id="Inspection" order="5" weight="0.4" />
112 |       <window_info anchor="bottom" id="TODO" order="6" />
113 |       <window_info anchor="bottom" id="LuaCheck" order="7" />
114 |       <window_info anchor="bottom" id="Version Control" order="8" />
115 |       <window_info anchor="bottom" id="Database Changes" order="9" />
116 |       <window_info active="true" anchor="bottom" id="Terminal" order="10" visible="true" weight="0.329718" />
117 |       <window_info anchor="bottom" id="Event Log" order="11" side_tool="true" />
118 |       <window_info anchor="bottom" id="Docker" order="12" show_stripe_button="false" />
119 |       <window_info anchor="bottom" id="Python Console" order="13" />
120 |       <window_info anchor="right" id="Commander" internal_type="SLIDING" order="0" type="SLIDING" weight="0.4" />
121 |       <window_info anchor="right" id="Ant Build" order="1" weight="0.25" />
122 |       <window_info anchor="right" content_ui="combo" id="Hierarchy" order="2" weight="0.25" />
123 |       <window_info anchor="right" id="Cargo" order="3" />
124 |       <window_info anchor="right" id="Database" order="4" />
125 |       <window_info anchor="right" id="Palette&#9;" order="5" />
126 |       <window_info anchor="right" id="SciView" order="6" />
127 |       <window_info anchor="right" id="Json Parser" order="7" />
128 |     </layout>
129 |   </component>
130 |   <component name="TypeScriptGeneratedFilesManager">
131 |     <option name="version" value="1" />
132 |   </component>
133 |   <component name="editorHistoryManager">
134 |     <entry file="file://$PROJECT_DIR$/01-两数之和.py">
135 |       <provider selected="true" editor-type-id="text-editor">
136 |         <state relative-caret-position="248">
137 |           <caret line="12" column="6" lean-forward="true" selection-start-line="12" selection-start-column="6" selection-end-line="12" selection-end-column="6" />
138 |         </state>
139 |       </provider>
140 |     </entry>
141 |   </component>
142 | </project>


--------------------------------------------------------------------------------
/LeetCode-Python/01-两数之和.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |    def twoSum(self, nums, target):
 3 |         """
 4 |         :type nums: List[int]
 5 |         :type target: int
 6 |         :rtype: List[int]
 7 |         """
 8 |         result_nums = []
 9 |         length = len(nums)
10 |         for x in range(length):
11 |             for y in range(x+1,length):
12 |                 if nums[x] + nums[y] == target:
13 |                     result_nums.append(x)
14 |                     result_nums.append(y)
15 |                         
16 |         return result_nums
17 | 


--------------------------------------------------------------------------------
/LeetCode-Python/03-无重复字符的最长子串.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def lengthOfLongestSubstring(self, s: str) -> int:
 3 |         sum_str = ""
 4 |         i = k = 0
 5 |         lens = len(s)
 6 |         max = 0
 7 |         while i < lens and k < lens:
 8 |             if sum_str.find(s[k]) == -1:
 9 |                 sum_str += str(s[k])
10 |                 k += 1
11 |             else:
12 |                 i += 1
13 |                 k = i
14 |                 sum_str = ""
15 |             if max < len(sum_str):
16 |                 max = len(sum_str)
17 | 
18 |         return  max
19 | 
20 | 


--------------------------------------------------------------------------------
/LeetCode-Python/04-寻找两个有序数组的中位数.py:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Python/04-寻找两个有序数组的中位数.py


--------------------------------------------------------------------------------
/LeetCode-Python/09-回文数.py:
--------------------------------------------------------------------------------
1 | class Solution:
2 |     def isPalindrome(self, x: int) -> bool:
3 |         s = str(x)[::-1]
4 |         return s == str(x)
5 | 
6 | 


--------------------------------------------------------------------------------
/LeetCode-Python/13-罗马数字转整数.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def romanToInt(self, s: str) -> int:
 3 |         a = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
 4 |         ans = 0
 5 |         for i in range(len(s)):
 6 |             if i < len(s) - 1 and a[s[i]] < a[s[i + 1]]:
 7 |                 ans -= a[s[i]]
 8 |             else:
 9 |                 ans += a[s[i]]
10 |         return ans
11 | 


--------------------------------------------------------------------------------
/LeetCode-Python/14-最长公共前缀.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def longestCommonPrefix(self, strs: List[str]) -> str:
 3 |         if len(strs) == 0:
 4 |             return ""
 5 |         if len(strs) == 1:
 6 |             return strs[0]
 7 |         tmin = min(strs)
 8 |         tmax = max(strs)
 9 |         for i,c in enumerate(tmin):
10 |             if c != tmax[i]:
11 |                 return tmin[:i]
12 | 
13 |         return tmin
14 | 


--------------------------------------------------------------------------------
/LeetCode-Python/20-有效括号匹配.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def isValid(self, s):
 3 |         stack = list(['1'])
 4 |         for st in s:
 5 |             if st in ['(', '[', '{']:
 6 |                 stack.append(st)
 7 |             elif (stack[len(stack)-1]+st) not in ['()', '[]', '{}']:
 8 |                 stack.append(st)
 9 |             else:
10 |                 stack.pop()
11 |         if stack == ['1']:
12 |             return True
13 |         else:
14 |             return False
15 | 


--------------------------------------------------------------------------------
/LeetCode-Python/21-合并两个有序链表.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
 3 |         if l1 == None:
 4 |             return l2
 5 |         if l2 == None:
 6 |             return l1
 7 |         result = ListNode(None)
 8 |         if l1.val >= l2.val:
 9 |             result = l2
10 |             result.next = self.mergeTwoLists(l1,l2.next)
11 |         else:
12 |             result = l1
13 |             result.next = self.mergeTwoLists(l1.next, l2)
14 |             
15 |         return result
16 | 


--------------------------------------------------------------------------------
/LeetCode-Python/26-删除数据重复项.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def removeDuplicates(self, nums: object) -> int:
 3 |         if len(nums) < 2:
 4 |             return len(nums)
 5 |         count = 0
 6 |         arr = []
 7 |         for i in range(1,len(nums)):
 8 |             if nums[count] != nums[i]:
 9 |                 count += 1
10 |                 nums[count] = nums[i]
11 |                 arr.append(nums[i])
12 | 
13 |         print(arr)
14 |         return count+1
15 | 
16 | b = Solution.removeDuplicates(None,[1,1,12,45,45,89,99,99,99,99])
17 | 


--------------------------------------------------------------------------------
/LeetCode-Python/27.移出元素.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def removeElement(self, nums: List[int], val: int) -> int:
 3 |         if len(nums) == 0:
 4 |             return 0
 5 |         num = 0
 6 |         for i in range(len(nums)):
 7 |             if nums[i] != val:
 8 |                 nums[num] = nums[i]
 9 |                 num += 1
10 |         return num
11 | 


--------------------------------------------------------------------------------
/LeetCode-Python/28-实现strStr().py:
--------------------------------------------------------------------------------
1 | class Solution:
2 |     def strStr(self, haystack: str, needle: str) -> int:
3 |         return haystack.find(str)
4 | 


--------------------------------------------------------------------------------
/LeetCode-Python/35-搜索插入位置.py:
--------------------------------------------------------------------------------
 1 | # 二分法 采用快指针和慢指针
 2 | class Solution:
 3 |     def searchInsert(self, nums: List[int], target: int) -> int:
 4 |         low = 0
 5 |         high = len(nums)
 6 |         while low < high:
 7 |             mid = int(low + (high - low) / 2)
 8 |             if nums[mid] > target:
 9 |                 high = mid
10 |             elif nums[mid] < target:
11 |                 low = mid + 1
12 |             else:
13 |                 return mid
14 |         return low
15 | 


--------------------------------------------------------------------------------
/LeetCode-Python/38-报数.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def countAndSay(self, n: int) -> str:
 3 |         if n == 1:
 4 |             return "1"
 5 |         else:
 6 |             st = self.countAndSay(n-1)
 7 |             count = 1
 8 |             res = ""
 9 |             for i in range(0, len(st)):
10 |                 if i+1 < len(st) and st[i] == st[i+1]:
11 |                     count += 1
12 |                 else:
13 |                     res = res+ str(count)+str(st[i])
14 |                     count = 1 
15 |         return res


--------------------------------------------------------------------------------
/LeetCode-Python/53-最大子序和.py:
--------------------------------------------------------------------------------
 1 | class Solution:
 2 |     def maxSubArray(self, nums: List[int]) -> int:
 3 |         sum = 0
 4 |         max_sum = nums[0]
 5 |         for i in range(0, len(nums)):
 6 |             if sum < 0:
 7 |                 sum = nums[i]
 8 |             else:
 9 |                 sum += nums[i]
10 |             if sum > max_sum:
11 |                 max_sum = sum
12 |         return max_sum
13 | 


--------------------------------------------------------------------------------
/LeetCode-Python/LeetCode-Python.iml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <module type="PYTHON_MODULE" version="4">
3 |   <component name="NewModuleRootManager">
4 |     <content url="file://$MODULE_DIR$" />
5 |     <orderEntry type="jdk" jdkName="Python 3.6 (test)" jdkType="Python SDK" />
6 |     <orderEntry type="sourceFolder" forTests="false" />
7 |   </component>
8 | </module>


--------------------------------------------------------------------------------
/LeetCode-Rust/.idea/encodings.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <project version="4">
3 |   <component name="Encoding" addBOMForNewFiles="with NO BOM" />
4 | </project>


--------------------------------------------------------------------------------
/LeetCode-Rust/.idea/misc.xml:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8"?>
 2 | <project version="4">
 3 |   <component name="CargoProjects">
 4 |     <cargoProject FILE="$PROJECT_DIR$/Cargo.toml" />
 5 |   </component>
 6 |   <component name="ProjectRootManager">
 7 |     <output url="file://$PROJECT_DIR$/out" />
 8 |   </component>
 9 |   <component name="RustProjectSettings">
10 |     <option name="toolchainHomeDirectory" value="$USER_HOME$/.cargo/bin" />
11 |   </component>
12 | </project>


--------------------------------------------------------------------------------
/LeetCode-Rust/.idea/modules.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <project version="4">
3 |   <component name="ProjectModuleManager">
4 |     <modules>
5 |       <module fileurl="file://$PROJECT_DIR$/LeetCode-Rust.iml" filepath="$PROJECT_DIR$/LeetCode-Rust.iml" />
6 |     </modules>
7 |   </component>
8 | </project>


--------------------------------------------------------------------------------
/LeetCode-Rust/.idea/vcs.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="UTF-8"?>
2 | <project version="4">
3 |   <component name="VcsDirectoryMappings">
4 |     <mapping directory="$PROJECT_DIR$/.." vcs="Git" />
5 |   </component>
6 | </project>


--------------------------------------------------------------------------------
/LeetCode-Rust/.idea/workspace.xml:
--------------------------------------------------------------------------------
  1 | <?xml version="1.0" encoding="UTF-8"?>
  2 | <project version="4">
  3 |   <component name="ChangeListManager">
  4 |     <list default="true" id="72a26e82-041c-4f29-a4c8-8cde4f2e16b8" name="Default Changelist" comment="" />
  5 |     <ignored path="$PROJECT_DIR$/target/" />
  6 |     <ignored path="$PROJECT_DIR$/out/" />
  7 |     <option name="EXCLUDED_CONVERTED_TO_IGNORED" value="true" />
  8 |     <option name="SHOW_DIALOG" value="false" />
  9 |     <option name="HIGHLIGHT_CONFLICTS" value="true" />
 10 |     <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
 11 |     <option name="LAST_RESOLUTION" value="IGNORE" />
 12 |   </component>
 13 |   <component name="FileEditorManager">
 14 |     <leaf>
 15 |       <file pinned="false" current-in-tab="true">
 16 |         <entry file="file://$PROJECT_DIR$/main.rs">
 17 |           <provider selected="true" editor-type-id="text-editor">
 18 |             <state relative-caret-position="62">
 19 |               <caret line="2" column="8" lean-forward="true" selection-start-line="2" selection-start-column="8" selection-end-line="2" selection-end-column="8" />
 20 |             </state>
 21 |           </provider>
 22 |         </entry>
 23 |       </file>
 24 |       <file pinned="false" current-in-tab="false">
 25 |         <entry file="file://$PROJECT_DIR$/53-最大子序和.rs">
 26 |           <provider selected="true" editor-type-id="text-editor" />
 27 |         </entry>
 28 |       </file>
 29 |       <file pinned="false" current-in-tab="false">
 30 |         <entry file="file://$PROJECT_DIR$/38-报数.rs">
 31 |           <provider selected="true" editor-type-id="text-editor">
 32 |             <state relative-caret-position="295">
 33 |               <caret line="51" column="41" selection-start-line="51" selection-start-column="19" selection-end-line="51" selection-end-column="41" />
 34 |             </state>
 35 |           </provider>
 36 |         </entry>
 37 |       </file>
 38 |     </leaf>
 39 |   </component>
 40 |   <component name="IdeDocumentHistory">
 41 |     <option name="CHANGED_PATHS">
 42 |       <list>
 43 |         <option value="$PROJECT_DIR$/main.rs" />
 44 |       </list>
 45 |     </option>
 46 |   </component>
 47 |   <component name="ProjectFrameBounds" extendedState="1">
 48 |     <option name="y" value="23" />
 49 |     <option name="width" value="1280" />
 50 |     <option name="height" value="737" />
 51 |   </component>
 52 |   <component name="ProjectView">
 53 |     <navigator proportions="" version="1">
 54 |       <foldersAlwaysOnTop value="true" />
 55 |     </navigator>
 56 |     <panes>
 57 |       <pane id="ProjectPane">
 58 |         <subPane>
 59 |           <expand>
 60 |             <path>
 61 |               <item name="LeetCode-Rust" type="b2602c69:ProjectViewProjectNode" />
 62 |               <item name="LeetCode-Rust" type="462c0819:PsiDirectoryNode" />
 63 |             </path>
 64 |           </expand>
 65 |           <select />
 66 |         </subPane>
 67 |       </pane>
 68 |       <pane id="PackagesPane" />
 69 |       <pane id="Scope" />
 70 |     </panes>
 71 |   </component>
 72 |   <component name="PropertiesComponent">
 73 |     <property name="go.gopath.indexing.explicitly.defined" value="true" />
 74 |     <property name="nodejs_interpreter_path.stuck_in_default_project" value="undefined stuck path" />
 75 |     <property name="nodejs_npm_path_reset_for_default_project" value="true" />
 76 |     <property name="org.rust.cargo.project.model.PROJECT_DISCOVERY" value="true" />
 77 |   </component>
 78 |   <component name="RunDashboard">
 79 |     <option name="ruleStates">
 80 |       <list>
 81 |         <RuleState>
 82 |           <option name="name" value="ConfigurationTypeDashboardGroupingRule" />
 83 |         </RuleState>
 84 |         <RuleState>
 85 |           <option name="name" value="StatusDashboardGroupingRule" />
 86 |         </RuleState>
 87 |       </list>
 88 |     </option>
 89 |   </component>
 90 |   <component name="RunManager">
 91 |     <configuration name="Run LeetCode-Rust" type="CargoCommandRunConfiguration" factoryName="Cargo Command" temporary="true">
 92 |       <option name="channel" value="DEFAULT" />
 93 |       <option name="command" value="run --package LeetCode-Rust --bin LeetCode-Rust" />
 94 |       <option name="allFeatures" value="false" />
 95 |       <option name="nocapture" value="false" />
 96 |       <option name="backtrace" value="SHORT" />
 97 |       <option name="workingDirectory" value="file://$PROJECT_DIR$" />
 98 |       <envs />
 99 |       <method v="2" />
100 |     </configuration>
101 |     <recent_temporary>
102 |       <list>
103 |         <item itemvalue="Cargo Command.Run LeetCode-Rust" />
104 |       </list>
105 |     </recent_temporary>
106 |   </component>
107 |   <component name="ToolWindowManager">
108 |     <frame x="0" y="23" width="1280" height="737" extended-state="1" />
109 |     <editor active="true" />
110 |     <layout>
111 |       <window_info id="Designer" />
112 |       <window_info id="Favorites" side_tool="true" />
113 |       <window_info content_ui="combo" id="Project" order="0" visible="true" weight="0.37883684" />
114 |       <window_info id="Structure" order="1" side_tool="true" weight="0.25" />
115 |       <window_info anchor="bottom" id="LuaCheck" />
116 |       <window_info anchor="bottom" id="Database Changes" />
117 |       <window_info anchor="bottom" id="Version Control" />
118 |       <window_info anchor="bottom" id="Terminal" />
119 |       <window_info anchor="bottom" id="Event Log" side_tool="true" />
120 |       <window_info anchor="bottom" id="Message" order="0" />
121 |       <window_info anchor="bottom" id="Find" order="1" />
122 |       <window_info active="true" anchor="bottom" id="Run" order="2" visible="true" weight="0.3255814" />
123 |       <window_info anchor="bottom" id="Debug" order="3" weight="0.4" />
124 |       <window_info anchor="bottom" id="Cvs" order="4" weight="0.25" />
125 |       <window_info anchor="bottom" id="Inspection" order="5" weight="0.4" />
126 |       <window_info anchor="bottom" id="TODO" order="6" />
127 |       <window_info anchor="right" id="Database" />
128 |       <window_info anchor="right" id="Cargo" />
129 |       <window_info anchor="right" id="Palette&#9;" />
130 |       <window_info anchor="right" id="SciView" />
131 |       <window_info anchor="right" id="Json Parser" />
132 |       <window_info anchor="right" id="Commander" internal_type="SLIDING" order="0" type="SLIDING" weight="0.4" />
133 |       <window_info anchor="right" id="Ant Build" order="1" weight="0.25" />
134 |       <window_info anchor="right" content_ui="combo" id="Hierarchy" order="2" weight="0.25" />
135 |     </layout>
136 |   </component>
137 |   <component name="TypeScriptGeneratedFilesManager">
138 |     <option name="version" value="1" />
139 |   </component>
140 |   <component name="editorHistoryManager">
141 |     <entry file="file://$PROJECT_DIR$/53-最大子序和.rs">
142 |       <provider selected="true" editor-type-id="text-editor" />
143 |     </entry>
144 |     <entry file="file://$PROJECT_DIR$/38-报数.rs">
145 |       <provider selected="true" editor-type-id="text-editor">
146 |         <state relative-caret-position="295">
147 |           <caret line="51" column="41" selection-start-line="51" selection-start-column="19" selection-end-line="51" selection-end-column="41" />
148 |         </state>
149 |       </provider>
150 |     </entry>
151 |     <entry file="file://$PROJECT_DIR$/main.rs">
152 |       <provider selected="true" editor-type-id="text-editor">
153 |         <state relative-caret-position="62">
154 |           <caret line="2" column="8" lean-forward="true" selection-start-line="2" selection-start-column="8" selection-end-line="2" selection-end-column="8" />
155 |         </state>
156 |       </provider>
157 |     </entry>
158 |   </component>
159 | </project>


--------------------------------------------------------------------------------
/LeetCode-Rust/01-两数之和.rs:
--------------------------------------------------------------------------------
 1 | impl Solution {
 2 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
 3 |         let mut rev =vec![-1i32;2];
 4 |         for i in 0..nums.len()  {
 5 |             let mut a = target - nums[i];
 6 |             for k in i+1..nums.len() {
 7 |                 if a == nums[k] {
 8 |                     rev[0]=k as i32;
 9 |                     rev[1]=i as i32;
10 |                     return rev 
11 |                 }
12 |             }
13 |         }
14 |         rev
15 |     }
16 | }
17 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/03-无重复字符的最长子串.rs:
--------------------------------------------------------------------------------
 1 | impl Solution {
 2 |     pub fn length_of_longest_substring(s: String) -> i32 {
 3 |         let seq: Vec<char> = s.chars().collect();
 4 |         let mut sum_str:Vec<char> = vec![];
 5 |         let mut i = 0;
 6 |         let mut k = 0;
 7 |         let mut max = 0;
 8 |         let len = s.len();
 9 |         while i < len && k < len {
10 |             if index_str(seq[k],sum_str.clone()) == -1 {
11 |                 sum_str.push(seq[k]);
12 |                 k += 1;
13 |             } else {
14 |                 i += 1;
15 |                 k = i;
16 |                 sum_str = vec![];
17 |             }
18 |             if max < sum_str.len(){
19 |                 max = sum_str.len()
20 |             }
21 |         }
22 |         return max as i32;
23 |     }
24 | }
25 | fn index_str(c:char, vec:Vec<char>)-> i32{
26 |     for item in vec {
27 |         if item == c {
28 |             return 1;
29 |         }
30 |     }
31 |     return -1
32 | }


--------------------------------------------------------------------------------
/LeetCode-Rust/04-寻找两个有序数组的中位数.rs:
--------------------------------------------------------------------------------
 1 | fn main() {
 2 |     println!("{}",Solution::find_median_sorted_arrays(vec![1,3],vec![2]))
 3 | }
 4 | struct Solution;
 5 | impl Solution {
 6 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
 7 |         let len1 = nums1.len();
 8 |         let len2 = nums2.len();
 9 |         let mut nums_1 = nums1.clone();
10 |         let mut nums_2 = nums2.clone();
11 |         if len1 == 0 {
12 |             if len2 == 1 {
13 |                 return nums2[0] as f64;
14 |             } else {
15 |                 if len2 % 2 == 0 {
16 |                     let v = len2 / 2;
17 |                     return ((nums2[v] + nums2[v-1]) as f64)/2.0;
18 |                 } else {
19 |                     let v = len2 / 2;
20 |                     return nums2[v] as f64;
21 |                 }
22 |             }
23 |         }
24 |         if len2 == 0 {
25 |             if len1 == 1 {
26 |                 return nums1[0] as f64;
27 |             } else {
28 |                 if len1 % 2 == 0 {
29 |                     let v = len1 / 2;
30 |                     return ((nums1[v] + nums1[v-1]) as f64)/2.0;
31 |                 } else {
32 |                     let v = len1 / 2;
33 |                     return nums1[v] as f64;
34 |                 }
35 |             }
36 |         }
37 |         let mut limit = 0;
38 |         let mut times = 0;
39 |         let mut  flag = 0;
40 |         let len_sum = len1 + len2;
41 |         if len_sum % 2 == 0 {
42 |             flag = 2;
43 | //            循环的次数
44 |             limit = len_sum / 2 + 1
45 |         } else {
46 |             flag = 1;
47 |             limit = len_sum / 2 + 1
48 |         }
49 |         let mut ans = vec![];
50 |         while times < limit {
51 |             let mut l1 = nums_1.len();
52 |             let mut l2 = nums_2.len();
53 |             let l = ans.len();
54 |             if l1 != 0 && l2 != 0 {
55 |                 if nums_1[0] > nums_2[0] {
56 |                     let el = nums_2[0];
57 |                     ans.push(el);
58 |                     nums_2.remove(0 as usize);
59 |                 } else {
60 |                     let el = nums_1[0];
61 |                     ans.push(el);
62 |                     nums_1.remove(0 as usize);
63 |                 }
64 |             } else if l1 == 0 && l2 != 0 {
65 |                 let el = nums_2[0];
66 |                 ans.push(el);
67 |                 nums_2.remove(0 as usize);
68 |             } else if l2 == 0 && l1 != 0 {
69 |                 let el = nums_1[0];
70 |                 ans.push(el);
71 |                 nums_1.remove(0 as usize);
72 |             }
73 |             times += 1
74 |         }
75 |         let l = ans.len();
76 |         if flag == 2 {
77 |             return  ((ans[l-1] + ans[l-2]) as f64)/2.0;
78 |         } else {
79 |             return ans[l-1] as f64;
80 |         }
81 |     }
82 | }
83 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/09-回文数.rs:
--------------------------------------------------------------------------------
 1 | impl Solution {
 2 |     pub fn is_palindrome(x: i32) -> bool {
 3 |         if x < 0 {
 4 |             return false;
 5 |         }
 6 |         let mut sum = 0;
 7 |         let mut n = x;
 8 |         while n != 0 {
 9 |             sum = sum *10 + n%10;
10 |             n /= 10;
11 |         }
12 |         if sum == x {
13 |             return true;
14 |         }
15 |         return false
16 |     }
17 | }
18 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/13-罗马数字转整数.rs:
--------------------------------------------------------------------------------
 1 | use std::collections::HashMap;
 2 | impl Solution {
 3 |   pub fn roman_to_int(s: String) -> i32 {
 4 |  let mut v = Vec::new();
 5 |  for char in s.chars() {
 6 |   v.push(char);
 7 |  }
 8 |  let mut maps = HashMap::new();
 9 |  maps.insert(String::from("I"),1);
10 |  maps.insert(String::from("V"),5);
11 |  maps.insert(String::from("X"),10);
12 |  maps.insert(String::from("L"),50);
13 |  maps.insert(String::from("C"),100);
14 |  maps.insert(String::from("D"),500);
15 |  maps.insert(String::from("M"),1000);
16 |  let mut result = 0;
17 |  for i in 0..s.len()  {
18 |    let v1 = maps.get(&*(v[i].to_string())).unwrap().clone();
19 |    let mut v2 = 0;
20 |    if i < s.len()-1 {
21 |      v2 = maps.get(&*(v[i+1].to_string())).unwrap().clone();
22 |      if v1 < v2 {
23 |       result -= v1;
24 |      } else {
25 |       result += v1;
26 |      }
27 |    } else {
28 |      v2 = v1;
29 |      result += v2;
30 |    }
31 |   }
32 |  return result;
33 | }
34 | }
35 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/14-最长公共前缀.rs:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/14-最长公共前缀.rs


--------------------------------------------------------------------------------
/LeetCode-Rust/20-有效括号匹配.rs:
--------------------------------------------------------------------------------
 1 | use std::collections::HashMap;
 2 | impl Solution {
 3 |     pub fn is_valid(s: String) -> bool {
 4 |         let mut stack = vec!["1".to_string()];
 5 |         let mut map = HashMap::new();
 6 |         map.insert(String::from("{"),"}");
 7 |         map.insert(String::from("["),"]");
 8 |         map.insert(String::from("("),")");
 9 |         for it in s.chars() {
10 |             let c2s = it.to_string();
11 |             let ss = map.get(&c2s);
12 |             if let Some(b) = ss{
13 |                 stack.push(c2s.clone());
14 |             } else {
15 |                 let mut s1 = stack.pop().unwrap();
16 |                 let s2 = map.get(&s1);
17 |                 if let Some(U) = s2{
18 |                     if *U != c2s {
19 |                         return false;
20 |                     }
21 |                 } else {
22 |                     return false;
23 |                 }
24 |             }
25 |         }
26 |         if stack.len()==1{
27 |             return true;
28 |         } else {
29 |             return false;
30 |         }
31 |     }
32 | }
33 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/21-合并链表.rs:
--------------------------------------------------------------------------------
 1 | #[derive(PartialEq, Eq, Debug)]
 2 |  pub struct ListNode {
 3 |    pub val: i32,
 4 |    pub next: Option<Box<ListNode>>
 5 |  }
 6 |  impl ListNode {
 7 |    #[inline]
 8 |    fn new(val: i32) -> Self {
 9 |      ListNode {
10 |        next: None,
11 |        val
12 |      }
13 |    }
14 |  }
15 | struct Solution{}
16 | impl Solution {
17 |     pub fn merge_two_lists(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
18 |         let  l11 = l1.as_ref().unwrap();
19 |         let  l22 = l2.as_ref().unwrap();
20 |          if let Some(L1) = l1.as_ref() {
21 |              println!("{:?}",L1);
22 |          } else {
23 |             return l2;
24 |          }
25 |          if let Some(L2) = l2.as_ref() {
26 |              println!("{:?}",L2);
27 |          } else {
28 |             return l1;
29 |          }
30 |         let mut reslut = Some(Box::new(ListNode::new(-1)));
31 | 
32 |         if l11.val >= l22.val {
33 |             reslut = l2;
34 |             let mut res = reslut.as_ref().unwrap();
35 |             let b = Solution::merge_two_lists(l1,l22.next);
36 |             let mut  n = &res.next;
37 |             n = &b;
38 | //            println!("{:?}", &b);
39 | //            println!("{:?}", n);
40 | //            res.next = Solution::merge_two_lists(l1,l22.next);
41 |         } else {
42 |             reslut =l1;
43 | //            let mut res = reslut.as_ref().unwrap();
44 | //            res.next = Solution::merge_two_lists(l11.next,l2);
45 |         }
46 |         return reslut
47 |     }
48 | }
49 | 
50 | fn main() {
51 |     let mut l1 = ListNode::new(12);
52 |     let mut l11 = ListNode::new(30);
53 |     l1.next = Some(Box::new(l11));
54 |     let mut l3 = ListNode::new(12);
55 |     let mut l33 = ListNode::new(50);
56 |     l3.next = Some(Box::new(l33));
57 |     Solution::merge_two_lists(Some(Box::new(l1)),Some(Box::new(l3)));
58 | }
59 | 
60 | 
61 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/26-删除排序数组中的重复项.rs:
--------------------------------------------------------------------------------
 1 | 
 2 | 
 3 | 
 4 | fn main() {
 5 |     let mut arr = vec![1,2,3,4,4,4,5];
 6 |     let a = Solution::remove_duplicates(&mut arr);
 7 |     println!("{}",a);
 8 | }
 9 | struct Solution;
10 | impl Solution {
11 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
12 |         let mut len = nums.len();
13 |         if  len  < 2 {
14 |             return len as i32;
15 |         }
16 |         let mut count = 0;
17 |         for i in 1..len {
18 |             if nums[count] != nums[i]{
19 |                 count += 1;
20 |                 nums[count] = nums[i];
21 |             }
22 |         }
23 |         return count as i32 + 1;
24 |     }
25 | }


--------------------------------------------------------------------------------
/LeetCode-Rust/27-移出元素.rs:
--------------------------------------------------------------------------------
 1 | 
 2 | fn main() {
 3 |     let mut arr = vec![1,2,3,4,4,4,5];
 4 |     let a = Solution::remove_element(&mut arr,4);
 5 |     println!("{}",a);
 6 | }
 7 | struct Solution;
 8 | impl Solution {
 9 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
10 |         if nums.len() == 0 {
11 |             return 0
12 |         }
13 |         let mut  i = 0;
14 |         for j in 0..nums.len() {
15 |             if nums[j] != val {
16 |                 nums[i] = nums[j];
17 |                 i += 1;
18 |             }
19 |         }
20 |         return i as i32;
21 |     }
22 | }


--------------------------------------------------------------------------------
/LeetCode-Rust/28-实现strStr().rs:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/28-实现strStr().rs


--------------------------------------------------------------------------------
/LeetCode-Rust/35. 搜索插入位置.rs:
--------------------------------------------------------------------------------
 1 | fn main() {
 2 |     let b = Solution::search_insert(vec![1,2,3,4,5],6);
 3 |     println!("{}",b);
 4 | 
 5 | }
 6 | struct Solution;
 7 | impl Solution {
 8 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
 9 |         let mut low = 0;
10 |         let mut high = nums.len();
11 |         while low < high {
12 |             let mid = low + (high - low)/2;
13 |             if nums[mid] < target {
14 |                 low = mid + 1;
15 |             } else if nums[mid] > target {
16 |                 high = mid;
17 |             } else {
18 |                 return  mid as i32;
19 |             }
20 |         }
21 |         return low as i32;
22 |     }
23 | }


--------------------------------------------------------------------------------
/LeetCode-Rust/38-报数.rs:
--------------------------------------------------------------------------------
 1 | 
 2 | use std::char::from_digit;
 3 | fn main() {
 4 |     let b = Solution::count_and_say(4);
 5 |     println!("{}",b);
 6 | 
 7 | }
 8 | struct Solution;
 9 | // 正常做法
10 | //impl Solution {
11 | //    pub fn count_and_say(n: i32) -> String {
12 | //        let mut res = vec!['1'];
13 | //        for _ in 0..n-1 {
14 | //            let mut temp = Vec::new();
15 | //            let mut i = 0_usize;
16 | //            while i < res.len() {
17 | //                let mut j = i + 1;
18 | //                while j < res.len() && res[j] == res[i] {
19 | //                    j += 1;
20 | //                }
21 | //                temp.push(from_digit((j - i) as u32, 10).unwrap());
22 | //                temp.push(res[i]);
23 | //                i = j;
24 | //            }
25 | //            res = temp;
26 | //        }
27 | //        res.iter().collect()
28 | //    }
29 | //}
30 | // 递归做法
31 | impl Solution {
32 |     pub fn count_and_say(n: i32) -> String {
33 |         if n == 1 {
34 |             return "1".to_string();
35 |         } else {
36 |             let mut rvecs = vec![];
37 |             let str = &*(Solution::count_and_say(n-1));
38 |             let mut vecs = vec![];
39 |             let mut count:u32 = 1;
40 |             for char in str.chars() {
41 |                 vecs.push(char);
42 |             }
43 |             for i in 0..vecs.len() {
44 |                 if i+1 < vecs.len() && vecs[i] == vecs[i+1]{
45 |                     count += 1;
46 |                 } else {
47 |                     rvecs.push(from_digit(count, 10).unwrap());
48 |                     rvecs.push(vecs[i]);
49 |                     count = 1;
50 |                 }
51 |             }
52 |             return rvecs.iter().collect();
53 |         }
54 |     }
55 | }


--------------------------------------------------------------------------------
/LeetCode-Rust/53-最大子序和.rs:
--------------------------------------------------------------------------------
 1 | impl Solution {
 2 |     pub fn max_sub_array(nums: Vec<i32>) -> i32 {
 3 |         let mut sum = 0;
 4 |         let mut max_sum = nums[0];
 5 |         for num in nums {
 6 |             if sum < 0 {
 7 |                 sum = num
 8 |             } else {
 9 |                 sum += num
10 |             }
11 |             if sum > max_sum{
12 |                 max_sum = sum
13 |             }
14 |         }
15 |         return max_sum
16 |     }
17 | }


--------------------------------------------------------------------------------
/LeetCode-Rust/Cargo.lock:
--------------------------------------------------------------------------------
1 | [[package]]
2 | name = "LeetCode-Rust"
3 | version = "0.1.0"
4 | 
5 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/Cargo.toml:
--------------------------------------------------------------------------------
 1 | [package]
 2 | name = "LeetCode-Rust"
 3 | version = "0.1.0"
 4 | authors = ["刘玉刚 <huayue430@126.com>"]
 5 | edition = "2018"
 6 | 
 7 | [dependencies]
 8 | 
 9 | [[bin]]
10 | name = "LeetCode-Rust"
11 | path = "main.rs"
12 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/LeetCode-Rust.iml:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8"?>
 2 | <module type="RUST_MODULE" version="4">
 3 |   <component name="Go" enabled="true" />
 4 |   <component name="NewModuleRootManager" inherit-compiler-output="true">
 5 |     <exclude-output />
 6 |     <content url="file://$MODULE_DIR$">
 7 |       <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
 8 |       <sourceFolder url="file://$MODULE_DIR$/examples" isTestSource="false" />
 9 |       <sourceFolder url="file://$MODULE_DIR$/tests" isTestSource="true" />
10 |       <sourceFolder url="file://$MODULE_DIR$/benches" isTestSource="true" />
11 |       <excludeFolder url="file://$MODULE_DIR$/target" />
12 |     </content>
13 |     <orderEntry type="inheritedJdk" />
14 |     <orderEntry type="sourceFolder" forTests="false" />
15 |   </component>
16 | </module>


--------------------------------------------------------------------------------
/LeetCode-Rust/main.rs:
--------------------------------------------------------------------------------
 1 | fn main() {
 2 |   println!("{}",Solution::find_median_sorted_arrays(vec![1,3],vec![2]))
 3 | }
 4 | struct Solution;
 5 | impl Solution {
 6 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
 7 |         let len1 = nums1.len();
 8 |         let len2 = nums2.len();
 9 |         let mut nums_1 = nums1.clone();
10 |         let mut nums_2 = nums2.clone();
11 |         if len1 == 0 {
12 |             if len2 == 1 {
13 |                 return nums2[0] as f64;
14 |             } else {
15 |                 if len2 % 2 == 0 {
16 |                     let v = len2 / 2;
17 |                     return ((nums2[v] + nums2[v-1]) as f64)/2.0;
18 |                 } else {
19 |                     let v = len2 / 2;
20 |                     return nums2[v] as f64;
21 |                 }
22 |             }
23 |         }
24 |         if len2 == 0 {
25 |             if len1 == 1 {
26 |                 return nums1[0] as f64;
27 |             } else {
28 |                 if len1 % 2 == 0 {
29 |                     let v = len1 / 2;
30 |                     return ((nums1[v] + nums1[v-1]) as f64)/2.0;
31 |                 } else {
32 |                     let v = len1 / 2;
33 |                     return nums1[v] as f64;
34 |                 }
35 |             }
36 |         }
37 |         let mut limit = 0;
38 |         let mut times = 0;
39 |         let mut  flag = 0;
40 |         let len_sum = len1 + len2;
41 |         if len_sum % 2 == 0 {
42 |             flag = 2;
43 | //            循环的次数
44 |             limit = len_sum / 2 + 1
45 |         } else {
46 |             flag = 1;
47 |             limit = len_sum / 2 + 1
48 |         }
49 |         let mut ans = vec![];
50 |         while times < limit {
51 |             let mut l1 = nums_1.len();
52 |             let mut l2 = nums_2.len();
53 |             let l = ans.len();
54 |             if l1 != 0 && l2 != 0 {
55 |                 if nums_1[0] > nums_2[0] {
56 |                     let el = nums_2[0];
57 |                     ans.push(el);
58 |                     nums_2.remove(0 as usize);
59 |                 } else {
60 |                     let el = nums_1[0];
61 |                     ans.push(el);
62 |                     nums_1.remove(0 as usize);
63 |                 }
64 |             } else if l1 == 0 && l2 != 0 {
65 |                 let el = nums_2[0];
66 |                 ans.push(el);
67 |                 nums_2.remove(0 as usize);
68 |             } else if l2 == 0 && l1 != 0 {
69 |                 let el = nums_1[0];
70 |                 ans.push(el);
71 |                 nums_1.remove(0 as usize);
72 |             }
73 |             times += 1
74 |         }
75 |         let l = ans.len();
76 |         if flag == 2 {
77 |            return  ((ans[l-1] + ans[l-2]) as f64)/2.0;
78 |         } else {
79 |             return ans[l-1] as f64;
80 |         }
81 |     }
82 | }
83 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/target/.rustc_info.json:
--------------------------------------------------------------------------------
1 | {"rustc_fingerprint":5571196526538646596,"outputs":{"1617349019360157463":["___\nlib___.rlib\nlib___.dylib\nlib___.dylib\nlib___.a\nlib___.dylib\n/Users/apple/.rustup/toolchains/stable-x86_64-apple-darwin\ndebug_assertions\nproc_macro\ntarget_arch=\"x86_64\"\ntarget_endian=\"little\"\ntarget_env=\"\"\ntarget_family=\"unix\"\ntarget_feature=\"fxsr\"\ntarget_feature=\"sse\"\ntarget_feature=\"sse2\"\ntarget_feature=\"sse3\"\ntarget_feature=\"ssse3\"\ntarget_os=\"macos\"\ntarget_pointer_width=\"64\"\nunix\n",""],"3144802570395919623":["___\nlib___.rlib\nlib___.dylib\nlib___.dylib\nlib___.a\nlib___.dylib\n/Users/apple/.rustup/toolchains/stable-x86_64-apple-darwin\ndebug_assertions\nproc_macro\ntarget_arch=\"x86_64\"\ntarget_endian=\"little\"\ntarget_env=\"\"\ntarget_family=\"unix\"\ntarget_feature=\"fxsr\"\ntarget_feature=\"sse\"\ntarget_feature=\"sse2\"\ntarget_feature=\"sse3\"\ntarget_feature=\"ssse3\"\ntarget_os=\"macos\"\ntarget_pointer_width=\"64\"\nunix\n",""],"1164083562126845933":["rustc 1.32.0 (9fda7c223 2019-01-16)\nbinary: rustc\ncommit-hash: 9fda7c2237db910e41d6a712e9a2139b352e558b\ncommit-date: 2019-01-16\nhost: x86_64-apple-darwin\nrelease: 1.32.0\nLLVM version: 8.0\n",""]},"successes":{}}


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/.cargo-lock:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/.cargo-lock


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/.fingerprint/LeetCode-Rust-2bf0bcc5ad83b5f0/dep-test-bin-LeetCode_Rust-2bf0bcc5ad83b5f0:
--------------------------------------------------------------------------------
1 | main.rs


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/.fingerprint/LeetCode-Rust-2bf0bcc5ad83b5f0/test-bin-LeetCode_Rust-2bf0bcc5ad83b5f0:
--------------------------------------------------------------------------------
1 | 4ccd412ac6a2091d


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/.fingerprint/LeetCode-Rust-2bf0bcc5ad83b5f0/test-bin-LeetCode_Rust-2bf0bcc5ad83b5f0.json:
--------------------------------------------------------------------------------
1 | {"rustc":5105358705442676925,"features":"[]","target":18056394908628683735,"profile":4083950107701478736,"path":11302273381135081700,"deps":[],"local":[{"MtimeBased":[[1554342064,172192183],".fingerprint/LeetCode-Rust-2bf0bcc5ad83b5f0/dep-test-bin-LeetCode_Rust-2bf0bcc5ad83b5f0"]}],"rustflags":[],"edition":"Edition2018"}


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/.fingerprint/LeetCode-Rust-5696fac0a517894e/bin-LeetCode_Rust-5696fac0a517894e:
--------------------------------------------------------------------------------
1 | e0643690999c24be


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/.fingerprint/LeetCode-Rust-5696fac0a517894e/bin-LeetCode_Rust-5696fac0a517894e.json:
--------------------------------------------------------------------------------
1 | {"rustc":5105358705442676925,"features":"[]","target":18056394908628683735,"profile":5020535648876196930,"path":11302273381135081700,"deps":[],"local":[{"MtimeBased":[[1554709742,394159272],".fingerprint/LeetCode-Rust-5696fac0a517894e/dep-bin-LeetCode_Rust-5696fac0a517894e"]}],"rustflags":[],"edition":"Edition2018"}


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/.fingerprint/LeetCode-Rust-5696fac0a517894e/dep-bin-LeetCode_Rust-5696fac0a517894e:
--------------------------------------------------------------------------------
1 | main.rs


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/LeetCode-Rust:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/LeetCode-Rust


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/LeetCode-Rust.d:
--------------------------------------------------------------------------------
1 | /Users/apple/Desktop/GitHub/LeetCode/LeetCode-Rust/target/debug/LeetCode-Rust.dSYM: /Users/apple/Desktop/GitHub/LeetCode/LeetCode-Rust/main.rs
2 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/LeetCode-Rust.dSYM:
--------------------------------------------------------------------------------
1 | deps/LeetCode_Rust-5696fac0a517894e.dSYM


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/LeetCode_Rust-2bf0bcc5ad83b5f0:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/LeetCode_Rust-2bf0bcc5ad83b5f0


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/LeetCode_Rust-2bf0bcc5ad83b5f0.d:
--------------------------------------------------------------------------------
1 | /Users/apple/Desktop/GitHub/LeetCode/LeetCode-Rust/target/debug/LeetCode_Rust-2bf0bcc5ad83b5f0.dSYM: /Users/apple/Desktop/GitHub/LeetCode/LeetCode-Rust/main.rs
2 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/LeetCode_Rust-2bf0bcc5ad83b5f0.dSYM:
--------------------------------------------------------------------------------
1 | deps/LeetCode_Rust-2bf0bcc5ad83b5f0.dSYM


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/deps/LeetCode_Rust-2bf0bcc5ad83b5f0:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/deps/LeetCode_Rust-2bf0bcc5ad83b5f0


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/deps/LeetCode_Rust-2bf0bcc5ad83b5f0.d:
--------------------------------------------------------------------------------
1 | /Users/apple/Desktop/GitHub/LeetCode/LeetCode-Rust/target/debug/deps/LeetCode_Rust-2bf0bcc5ad83b5f0: main.rs
2 | 
3 | /Users/apple/Desktop/GitHub/LeetCode/LeetCode-Rust/target/debug/deps/LeetCode_Rust-2bf0bcc5ad83b5f0.d: main.rs
4 | 
5 | main.rs:
6 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/deps/LeetCode_Rust-2bf0bcc5ad83b5f0.dSYM/Contents/Info.plist:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8"?>
 2 | <!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
 3 | <plist version="1.0">
 4 | 	<dict>
 5 | 		<key>CFBundleDevelopmentRegion</key>
 6 | 		<string>English</string>
 7 | 		<key>CFBundleIdentifier</key>
 8 | 		<string>com.apple.xcode.dsym.LeetCode_Rust-2bf0bcc5ad83b5f0</string>
 9 | 		<key>CFBundleInfoDictionaryVersion</key>
10 | 		<string>6.0</string>
11 | 		<key>CFBundlePackageType</key>
12 | 		<string>dSYM</string>
13 | 		<key>CFBundleSignature</key>
14 | 		<string>????</string>
15 | 		<key>CFBundleShortVersionString</key>
16 | 		<string>1.0</string>
17 | 		<key>CFBundleVersion</key>
18 | 		<string>1</string>
19 | 	</dict>
20 | </plist>
21 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/deps/LeetCode_Rust-2bf0bcc5ad83b5f0.dSYM/Contents/Resources/DWARF/LeetCode_Rust-2bf0bcc5ad83b5f0:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/deps/LeetCode_Rust-2bf0bcc5ad83b5f0.dSYM/Contents/Resources/DWARF/LeetCode_Rust-2bf0bcc5ad83b5f0


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/deps/LeetCode_Rust-5696fac0a517894e:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/deps/LeetCode_Rust-5696fac0a517894e


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/deps/LeetCode_Rust-5696fac0a517894e.d:
--------------------------------------------------------------------------------
1 | /Users/apple/Desktop/GitHub/LeetCode/LeetCode-Rust/target/debug/deps/LeetCode_Rust-5696fac0a517894e: main.rs
2 | 
3 | /Users/apple/Desktop/GitHub/LeetCode/LeetCode-Rust/target/debug/deps/LeetCode_Rust-5696fac0a517894e.d: main.rs
4 | 
5 | main.rs:
6 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/deps/LeetCode_Rust-5696fac0a517894e.dSYM/Contents/Info.plist:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8"?>
 2 | <!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
 3 | <plist version="1.0">
 4 | 	<dict>
 5 | 		<key>CFBundleDevelopmentRegion</key>
 6 | 		<string>English</string>
 7 | 		<key>CFBundleIdentifier</key>
 8 | 		<string>com.apple.xcode.dsym.LeetCode_Rust-5696fac0a517894e</string>
 9 | 		<key>CFBundleInfoDictionaryVersion</key>
10 | 		<string>6.0</string>
11 | 		<key>CFBundlePackageType</key>
12 | 		<string>dSYM</string>
13 | 		<key>CFBundleSignature</key>
14 | 		<string>????</string>
15 | 		<key>CFBundleShortVersionString</key>
16 | 		<string>1.0</string>
17 | 		<key>CFBundleVersion</key>
18 | 		<string>1</string>
19 | 	</dict>
20 | </plist>
21 | 


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/deps/LeetCode_Rust-5696fac0a517894e.dSYM/Contents/Resources/DWARF/LeetCode_Rust-5696fac0a517894e:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/deps/LeetCode_Rust-5696fac0a517894e.dSYM/Contents/Resources/DWARF/LeetCode_Rust-5696fac0a517894e


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1256iturvpiv1n7i.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1256iturvpiv1n7i.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/19vflewwuvfdyb97.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/19vflewwuvfdyb97.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1hpmapa50f4kqihp.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1hpmapa50f4kqihp.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1qr2d35gt48lb8vk.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1qr2d35gt48lb8vk.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1tmov6htizy23n3h.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1tmov6htizy23n3h.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1v84pgkv2ou998of.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1v84pgkv2ou998of.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1yuwmo2o68vakup9.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/1yuwmo2o68vakup9.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2hnjzrgu1qgeu1af.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2hnjzrgu1qgeu1af.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2jjeu3fahuhf31m5.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2jjeu3fahuhf31m5.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2n0hmizvc9oyusyr.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2n0hmizvc9oyusyr.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2q2pvyd5khkc2v98.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2q2pvyd5khkc2v98.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2t7ckujg5pm65zzg.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2t7ckujg5pm65zzg.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2vb0zrxwthpagkha.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/2vb0zrxwthpagkha.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/30sf65joyo9ekyvh.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/30sf65joyo9ekyvh.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/32ft60g13yq61bfn.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/32ft60g13yq61bfn.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/3c4j3bzovrfkfnj7.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/3c4j3bzovrfkfnj7.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/3ubxedi59h4aj5ik.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/3ubxedi59h4aj5ik.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/3y7a5vp8i9141cdo.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/3y7a5vp8i9141cdo.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/43tpj7d9f74u3m7s.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/43tpj7d9f74u3m7s.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/45jbvzczyfb0v8mo.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/45jbvzczyfb0v8mo.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/4hxn4sibq3kj76o2.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/4hxn4sibq3kj76o2.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/4oybkrngg9rz7wkt.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/4oybkrngg9rz7wkt.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/50kw8dwj90g4gief.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/50kw8dwj90g4gief.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/5352oilpo024mzuo.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/5352oilpo024mzuo.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/59cgw6qj79r88ust.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/59cgw6qj79r88ust.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/6mo3offy3oruuqi.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/6mo3offy3oruuqi.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/dep-graph.bin:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/dep-graph.bin


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/fyd3jbjy8p2lfb.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/fyd3jbjy8p2lfb.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/gd49v5639vi6dvf.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/gd49v5639vi6dvf.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/k1sljs2szm4556m.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/k1sljs2szm4556m.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/query-cache.bin:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/query-cache.bin


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/work-products.bin:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo-1sfq6edueq5p6/work-products.bin


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo.lock:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-2auf6cwtluyov/s-fb3jsmu571-4tkybo.lock


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/10i5bcpefr9rnk22.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/10i5bcpefr9rnk22.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1c6qd64os1izg558.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1c6qd64os1izg558.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1fi7s02l6wl1ota8.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1fi7s02l6wl1ota8.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1ijuv1nchdiogsul.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1ijuv1nchdiogsul.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1obggas7cftsc295.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1obggas7cftsc295.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1um7ketxfi3690gc.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1um7ketxfi3690gc.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1vetoijszefce5pe.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1vetoijszefce5pe.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1zm3gcsafwpeifm0.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/1zm3gcsafwpeifm0.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/20zs8e6t5oygyfvc.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/20zs8e6t5oygyfvc.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/2fva14yv6vv6lhbf.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/2fva14yv6vv6lhbf.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/2kh8jfux11jn5j1d.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/2kh8jfux11jn5j1d.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/30d1coo6djf60t4.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/30d1coo6djf60t4.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/38yxf3rpc8erp76i.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/38yxf3rpc8erp76i.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/3d84ytrwf4tec0v1.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/3d84ytrwf4tec0v1.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/3lquy9lpx2t3w7nd.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/3lquy9lpx2t3w7nd.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/3nyuwdazorl9uyeh.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/3nyuwdazorl9uyeh.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/3t7prvmvr8g0cuby.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/3t7prvmvr8g0cuby.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/40dz9qdfh6hjf5t.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/40dz9qdfh6hjf5t.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/41yg71qaa2f0r27j.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/41yg71qaa2f0r27j.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/495bts4nsh7o0v3w.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/495bts4nsh7o0v3w.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4axcjhv6s8rvws5x.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4axcjhv6s8rvws5x.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4i0rywn1n9svk1uo.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4i0rywn1n9svk1uo.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4i6iqk2m2bky6xwn.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4i6iqk2m2bky6xwn.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4iokp1dw8go3t9ud.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4iokp1dw8go3t9ud.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4k83cct2kl4wvrkm.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4k83cct2kl4wvrkm.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4q1i1cxa13n5yx21.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4q1i1cxa13n5yx21.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4t6la84ch8tqrvuv.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4t6la84ch8tqrvuv.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4weea8nparm4jyip.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/4weea8nparm4jyip.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/52shiljcujysc5cv.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/52shiljcujysc5cv.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/54zjf4xv0lgeq215.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/54zjf4xv0lgeq215.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/574vpbuownei11ix.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/574vpbuownei11ix.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/58o6l6pwzdjc7sm7.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/58o6l6pwzdjc7sm7.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/5cbqghs96eyjmsg0.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/5cbqghs96eyjmsg0.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/d40mtyu0665grui.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/d40mtyu0665grui.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/dep-graph.bin:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/dep-graph.bin


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/mnigp1b9erqn671.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/mnigp1b9erqn671.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/qp18q4cf2p8ql06.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/qp18q4cf2p8ql06.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/query-cache.bin:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/query-cache.bin


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/work-products.bin:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/work-products.bin


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/wu0zsou8zdmbt47.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/wu0zsou8zdmbt47.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/y3j5st0c8cpuy4e.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax-3pb7e8il3h1t9/y3j5st0c8cpuy4e.o


--------------------------------------------------------------------------------
/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax.lock:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/target/debug/incremental/LeetCode_Rust-3a9n2u9ikjo32/s-fayuvvym6j-1wj1oax.lock


--------------------------------------------------------------------------------
/LeetCode-Rust/wasm.rs:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ai-word/LeetCode/dcd3543fb63b95e529a410221f5e86669010aafa/LeetCode-Rust/wasm.rs


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # leetCode
2 | Rust,Go,Python,JavaScript实现的leetCode,欢迎下载，学习
3 | 地址：https://blog.csdn.net/baihuaxiu123/article/category/8694093
4 | 持续更新中。。。
5 | https://ai-word.blog.csdn.net
6 | 


--------------------------------------------------------------------------------