Go 解法, 执行用时: 4ms, 内存消耗: 996KB, 提交时间: 2020-06-01

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)
var memo map[int]int = map[int]int{}
var s,t string
func main(){
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	s = scanner.Text()
	scanner.Scan()
	t = scanner.Text()
	lenT := len(t)
	var flag bool = false
	for i := 0;i < lenT;i++{
		if s[0] == t[i] || s[0] == '*'{
			Dfs(i,0)
		}
		arr := make([]int,len(memo))
		var m int = 0
		for k,_ := range memo{
			delete(memo,k)
            if k != i{
			    flag = true

            }
			arr[m] = k
			m++
		}
		sort.Ints(arr)
		for j := 0;j < m;j++{
			if arr[j] == i{
				continue
			}
			fmt.Println(strconv.Itoa(i) + " "+ strconv.Itoa(arr[j]-i))
		}

	}
	if flag == false{
		fmt.Println("-1 0")

	}

}
func Dfs(i,j int){
	if j == len(s){
		memo[i]++
		return
	}
	if i == len(t){
		return
	}
	if s[j] == t[i]{
		Dfs(i+1,j+1)
	}else if s[j] == '*'{
		Dfs(i+1,j)
		Dfs(i,j+1)
		Dfs(i+1,j+1)
	}
	return
}

Go 解法, 执行用时: 5ms, 内存消耗: 1232KB, 提交时间: 2020-06-29

package main
 
import (
    "bufio"
    "fmt"
    "os"
    "sort"
    "strconv"
)
var memo map[int]int = map[int]int{}
var s,t string
func main(){
    scanner := bufio.NewScanner(os.Stdin)
    scanner.Scan()
    s = scanner.Text()
    scanner.Scan()
    t = scanner.Text()
    lenT := len(t)
    var flag bool = false
    for i := 0;i < lenT;i++{
        if s[0] == t[i] || s[0] == '*'{
            Dfs(i,0)
        }
        arr := make([]int,len(memo))
        var m int = 0
        for k,_ := range memo{
            delete(memo,k)
            if k != i{
                flag = true
 
            }
            arr[m] = k
            m++
        }
        sort.Ints(arr)
        for j := 0;j < m;j++{
            if arr[j] == i{
                continue
            }
            fmt.Println(strconv.Itoa(i) + " "+ strconv.Itoa(arr[j]-i))
        }
 
    }
    if flag == false{
        fmt.Println("-1 0")
 
    }
 
}
func Dfs(i,j int){
    if j == len(s){
        memo[i]++
        return
    }
    if i == len(t){
        return
    }
    if s[j] == t[i]{
        Dfs(i+1,j+1)
    }else if s[j] == '*'{
        Dfs(i+1,j)
        Dfs(i,j+1)
        Dfs(i+1,j+1)
    }
    return
}