Python vs Matlab—— find 与 np.where

Zjk = np.zeros((J, K), dtype=int) # 遍历S矩阵的每一行 for i in range(S.shape[0]): route_index = S[i, 0] - 1 # MATLAB索引转Python索引（-1操作） # 找到该路线服务的站点（MATLAB的find对应np.where） served_stops = np.where(phi_jk[:, route_index] > 0)[0] sum_pax = np.sum(U[served_stops]) if sum_pax <= c: Zjk[served_stops, route_index] = U[served_stops] U -= Zjk[:, route_index] # 更新剩余需求 elif i < S.shape[0]-1: # 收集后续路线的服务站点 otherserved_stops = np.array([], dtype=int) for j in range(i+1, S.shape[0]): otherroute_index = S[j, 0] - 1 otherserved_stops = np.concatenate(( otherserved_stops, np.where(phi_jk[:, otherroute_index] > 0)[0] )) # 求交集和差集 intersect_stop = np.intersect1d(served_stops, otherserved_stops) priority_stop = np.setdiff1d(served_stops, intersect_stop) if priority_stop.size > 0: Zjk[priority_stop, route_index] = U[priority_stop] # 计算剩余容量分配 remaining = c - np.sum(U[priority_stop]) Zjk[intersect_stop, route_index] = remaining U -= Zjk[:, route_index] else: if len(intersect_stop) == 1: Zjk[intersect_stop, route_index] = c U[intersect_stop] -= c else: # 均匀分配剩余容量 base = c // len(intersect_stop) for k in range(len(intersect_stop)-1): Zjk[intersect_stop[k], route_index] = base # 处理余数 Zjk[intersect_stop[-1], route_index] = c - base*(len(intersect_stop)-1) U -= Zjk[:, route_index] name 'S' is not defined