![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
Lora C
这个作者很懒,什么都没留下…
展开
-
leetcode 448. 找到所有数组中消失的数字
func findDisappearedNumbers(nums []int) []int { var cd []int map1 := make(map[int]int) for i := 1; i <= len(nums); i++ { map1[nums[i-1]] = i } for i := 1; i <= len(nums); i++ { if _, ok := map1[...原创 2019-09-09 21:42:04 · 201 阅读 · 0 评论 -
14.最长公共前缀
func longestCommonPrefix(strs []string) string { j := 0 if len(strs) == 1 { return strs[0] } else if len(strs) == 0 { return “” } else { min := math.MaxInt32 for i := 0; i <= len(strs)-1; i++ { if ...原创 2019-10-10 15:13:47 · 100 阅读 · 0 评论 -
141.环形链表
/** Definition for singly-linked list. type ListNode struct { Val int Next *ListNode } */ func hasCycle(head *ListNode) bool { hash := make(map[*ListNode]int) for head !=nil{ if _,ok :=hash[hea...原创 2019-10-10 13:46:23 · 93 阅读 · 0 评论 -
9. 回文数
func isPalindrome(x int) bool { y := 0 var xx =x for x!=0{ if x<0{ return false } y = y*10 +x%10 x = x/10 } return xx==y }原创 2019-09-11 21:50:21 · 95 阅读 · 0 评论 -
7. 整数反转
func reverse(x int) int { var restr string if x < 0 { strin := strconv.Itoa(x)[1:] fmt.Println(len(strin)) for i := len(strin) - 1; i >=0; i-- { restr += string(strin[i]) fmt.Println(restr) } re...原创 2019-09-11 21:05:05 · 77 阅读 · 0 评论 -
20. Valid Parentheses
func isValid(s string) bool { stack := make([]rune,0) frontMap := map[rune]rune{’)’: ‘(’, ‘]’: ‘[’, ‘}’: ‘{’,} for _, v := range s { if v == ‘(’ || v == ‘{’ || v == ‘[’ { stack = append(stack, v) } el...原创 2019-09-11 17:27:49 · 72 阅读 · 0 评论 -
167. 两数之和 II - 输入有序数组
func twoSum(numbers []int, target int) []int { maps := make(map[int]int) var arr []int for i :=0;i<len(numbers);i++{ tar := target-numbers[i] index,ok := maps[tar] if ok && maps[tar]!=i{ if...原创 2019-09-11 16:27:16 · 76 阅读 · 0 评论 -
1. Two Sum
1、时间复杂度:O(n^2) 对于每个元素,我们试图通过遍历数组的其余部分来寻找它所对应的目标元素,这将耗费 O(n)O(n) 的时间。因此时间复杂度为 O(n^2) func twoSum(nums []int, target int) []int { var arr []int for i:=0;i<len(nums)-1;i++{ for j:=i+1;j<len(nums);j...原创 2019-09-11 14:51:32 · 83 阅读 · 0 评论 -
543. Diameter of Binary Tree golang leetcode
func max(a int,b int)int{ if a>=b{ return a } return b } func maxall(a int,b int,c int)int{ return max(max(a,b),c) } func maxDepth1(root *TreeNode) int { if root==nil{ return 0 } l := maxDepth1(ro...原创 2019-09-11 11:27:55 · 116 阅读 · 0 评论 -
169. 求众数
/** @Author: chenhuihui @Date: 2019/9/9 20:38 */ package main import ( “fmt” ) func findDisappearedNumbers(nums []int) int { var pop []int var cd int arrLen := int(float64(len(nums)) / 2) for i := 0...原创 2019-09-10 13:42:24 · 88 阅读 · 0 评论 -
26. 删除排序数组中的重复项
func removeDuplicates(nums []int) int { i := 0 for j:= 1;j<len(nums);j++{ if nums[i]!=nums[j]{ i++ nums[i]=nums[j] } } return i+1 }原创 2019-10-10 17:38:49 · 117 阅读 · 0 评论