提示
以下内容的目的,只是为了学习合法的知识
shsupervisor:要安装的软件的名称。 supervisord:装好supervisor软件后,supervisord用于启动supervisor服务。 supervisorctl:用于管理supervisor配置文件中program。
使用yum命令安装 切换为root用户
shyum install epel-release # 如果已安装EPEL源,请跳过
yum install -y supervisor
systemctl enable supervisord # 开机自启动
systemctl start supervisord # 启动supervisord服务
systemctl status supervisord # 查看supervisord服务状态
ps -ef|grep supervisord # 查看是否存在supervisord进程
gopackage main
import "fmt"
type ListNode struct {
Val int
Next *ListNode
}
func getIntersectionNode(headA, headB *ListNode) *ListNode {
if headA == nil || headB == nil {
return nil
}
// 计算链表长度
lenA := 0
lenB := 0
currA, currB := headA, headB
for currA != nil {
lenA++
currA = currA.Next
}
for currB != nil {
lenB++
currB = currB.Next
}
// 对齐起点
currA, currB = headA, headB
if lenA > lenB {
for i := 0; i < lenA-lenB; i++ {
currA = currA.Next
}
} else {
for i := 0; i < lenB-lenA; i++ {
currB = currB.Next
}
}
// 同步遍历直到找到相交节点或遍历结束
for currA != nil && currB != nil {
if currA == currB {
return currA
}
currA = currA.Next
currB = currB.Next
}
return nil
}
// 测试代码
func main() {
// 构造链表A: 1 -> 2 -> 3 \
// 6 -> 7
// 4 -> 5 /
// 链表B: 4 -> 5 /
common := &ListNode{6, &ListNode{7, nil}}
headA := &ListNode{1, &ListNode{2, &ListNode{3, common}}}
headB := &ListNode{4, &ListNode{5, common}}
intersection := getIntersectionNode(headA, headB)
if intersection != nil {
fmt.Printf("相交节点值: %d\n", intersection.Val)
} else {
fmt.Println("没有相交节点")
}
}