algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-24 10:37:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #60 from halfrost/code_quality_improvement

Browse Source 
optimization code quality level from A to A+
This commit is contained in:
halfrost
2020-08-27 01:07:57 +08:00
committed by YDZ
parent 7b7307761c 96c36de45b
commit d2dfc2d634
543 changed files with 2449 additions and 2396 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I.go
View File

@ -4,12 +4,12 @@ func nextGreaterElement(nums1 []int, nums2 []int) []int {
if len(nums1) == 0 || len(nums2) == 0 {
return []int{}
}
res, reocrd, flag := []int{}, map[int]int{}, false
res, reocrd := []int{}, map[int]int{}
for i, v := range nums2 {
reocrd[v] = i
}
for i := 0; i < len(nums1); i++ {
flag = false
flag := false
for j := reocrd[nums1[i]]; j < len(nums2); j++ {
if nums2[j] > nums1[i] {
res = append(res, nums2[j])

4
leetcode/0496.Next-Greater-Element-I/496. Next Greater Element I_test.go
View File

@ -27,12 +27,12 @@ func Test_Problem496(t *testing.T) {
qs := []question496{
question496{
{
para496{[]int{4, 1, 2}, []int{1, 3, 4, 2}},
ans496{[]int{-1, 3, -1}},
},
question496{
{
para496{[]int{2, 4}, []int{1, 2, 3, 4}},
ans496{[]int{3, -1}},
},