endlesscheng / codeforces-go Goto Github PK

Stargazers

Forkers

binacsinf smakslow tiandiyijian terrywang727 jasperyu luohe wyx6816 11home alcuin1 jamesfifth songming-chou cph365 zodiacnumblzw enigma-pattern justwindy wyc06 goatgirl98 isgasho make04 jinterview zeta15 lpi njust-leeving gf903990608 runan520 yan0327 shuangpengpang zhang-quentin zyywang yachtcoder blow-in-the-wind mike-box hangboquan faltingsa lcoderfit go2flare zgtmy emmacicichen lion777-hpdz yourchanges bytebinacs amazinglyl 1020036662 liuyingbin1922 m1zzx2 ujhalf voidspiral dongfang1021 iphyer lyr-2000 dj456119 ruiwenfan conan-shen ccz972 yinqiaozhang angryreid masterliu66 study-day-day-up-up yaominzh bitzhjr cbweixin asdlei99 hammercloth buckwang0509 et3tsy euqorab awesomexiao123 ysu528 mikezhang-ghf huoyinghui kei921 changhuaqiu silence7x7 hubert-he dooyourbest qiancijun youfeng243 fireonice lidpeng ahao214 xiaoyugi orangewangjie hitxza hugo-spyder petermanchu luhuabupt zzzpppy j178 gogoto2 noob261 cjc-2468 jjj-tamu zhufenggit x-xk gskystar 018429 jujimeizuo pmzhu444 hugokung zhukson

POST https://leetcode.cn/accounts/login/ return code 500

func (*graph) mstPrim(dis [][]int, root int) (mst int, edges [][2]int) {
	...
	for {
		v := -1
		for w, in := range inMST {
			// if !in && (v < 0 || minD[w].d < minD[v].d) {
			if !in && min[w].d < inf && (v < 0 || minD[w].d < minD[v].d) { // 最小距离不能是无穷大
				v = w
			}
		}
		if v < 0 {
			return
		}
    	...
	}
}