[討論] 矩陣找相鄰元素最靠近0
我有個情況是想找出矩陣中最靠近0的元素
矩陣呈現Dual-dirac分布
假如 A=[0,0,0,1,2,3,4,5,1,2,0,0,0,0,0,1,1,5,8,7,6,0,0,0]
我是想找出最靠近第10個元素"2"跟第16個元素"1"
想得很久,有大大建議嗎
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.167.50.10
推
08/17 21:28, , 1F
08/17 21:28, 1F
→
08/17 21:30, , 2F
08/17 21:30, 2F
推
08/17 21:36, , 3F
08/17 21:36, 3F
→
08/17 22:23, , 4F
08/17 22:23, 4F
→
08/18 11:22, , 5F
08/18 11:22, 5F
→
08/18 11:23, , 6F
08/18 11:23, 6F
推
08/18 11:25, , 7F
08/18 11:25, 7F
→
08/18 11:25, , 8F
08/18 11:25, 8F