2016-06-28 47 views
0

BlocksPerColumn只是整體的一部分,但它只是爲了這個想法。試圖在一個列表中找到多個列表的最低值

BlocksPerColumn = [[[336350.0, 7089650.0, -7.0, 0.1665, 1.5, 1, 1, 'Ghost', 3, 'Ghost', 'Ghost', 'Ghost', 'Ghost', 2, 'Ghost', 0, -30000.0], [336350.0, 7089650.0, -5.0, 0.1542, 1.5, 1, 2, 'Ghost', 3, 'Ghost', 'Ghost', 'Ghost', 'Ghost', 2, 'Ghost', 0, -30000.0], [336350.0, 7089650.0, -3.0, 0.2259, 1.5, 1, 3, 'Ghost', 3, 'Ghost', 'Ghost', 'Ghost', 'Ghost', 2, 'Ghost', 1, 153475.49999999997], [336350.0, 7089650.0, -1.0, 0.2753, 1.5, 1, 4, 'Ghost', 3, 'Ghost', 'Ghost', 'Ghost', 'Ghost', 2, 'Ghost', 1, 200158.49999999997], [336350.0, 7089650.0, 1.0, 0.2236, 1.5, 1, 5, 'Ghost', 3, 'Ghost', 'Ghost', 'Ghost', 'Ghost', 2, 'Ghost', 1, 151301.99999999997]], [[336450.0, 7089550.0, -7.0, 0.1791, 1.5, 2, 6, 3, 6, 'Ghost', 'Ghost', 1, 7, 5, 'Ghost', 0, -30000.0], [336450.0, 7089550.0, -5.0, 0.1707, 1.5, 2, 7, 3, 6, 'Ghost', 'Ghost', 1, 7, 5, 'Ghost', 0, -30000.0], [336450.0, 7089550.0, -3.0, 0.2248, 1.5, 2, 8, 3, 6, 'Ghost', 'Ghost', 1, 7, 5, 'Ghost', 1, 152436.0], [336450.0, 7089550.0, -1.0, 0.2791, 1.5, 2, 9, 3, 6, 'Ghost', 'Ghost', 1, 7, 5, 'Ghost', 1, 203749.5], [336450.0, 7089550.0, 1.0, 0.3098, 1.5, 2, 10, 3, 6, 'Ghost', 'Ghost', 1, 7, 5, 'Ghost', 1, 232760.99999999994]], [[336450.0, 7089650.0, -5.0, 0.1488, 1.5, 3, 11, 'Ghost', 7, 2, 1, 'Ghost', 'Ghost', 6, 'Ghost', 0, -30000.0], [336450.0, 7089650.0, -3.0, 0.1961, 1.5, 3, 12, 'Ghost', 7, 2, 1, 'Ghost', 'Ghost', 6, 'Ghost', 0, -30000.0], [336450.0, 7089650.0, -1.0, 0.2499, 1.5, 3, 13, 'Ghost', 7, 2, 1, 'Ghost', 'Ghost', 6, 'Ghost', 1, 176155.5], [336450.0, 7089650.0, 1.0, 0.2939, 1.5, 3, 14, 'Ghost', 7, 2, 1, 'Ghost', 'Ghost', 6, 'Ghost', 1, 217735.5]], [[336550.0, 7089350.0, -7.0, 0.1774, 1.5, 4, 15, 5, 10, 'Ghost', 'Ghost', 'Ghost', 11, 9, 'Ghost', 0, -30000.0], [336550.0, 7089350.0, -5.0, 0.2551, 1.5, 4, 16, 5, 10, 'Ghost', 'Ghost', 'Ghost', 11, 9, 'Ghost', 1, 181069.5], [336550.0, 7089350.0, -3.0, 0.3489, 1.5, 4, 17, 5, 10, 'Ghost', 'Ghost', 'Ghost', 11, 9, 'Ghost', 1, 269710.49999999994], [336550.0, 7089350.0, -1.0, 0.3707, 1.5, 4, 18, 5, 10, 'Ghost', 'Ghost', 'Ghost', 11, 9, 'Ghost', 1, 290311.5], [336550.0, 7089350.0, 1.0, 0.3037, 1.5, 4, 19, 5, 10, 'Ghost', 'Ghost', 'Ghost', 11, 9, 'Ghost', 1, 226996.5]], [[336550.0, 7089450.0, -5.0, 0.1719, 1.5, 5, 20, 6, 11, 4, 'Ghost', 2, 12, 10, 'Ghost', 0, -30000.0], [336550.0, 7089450.0, -3.0, 0.3121, 1.5, 5, 21, 6, 11, 4, 'Ghost', 2, 12, 10, 'Ghost', 1, 234934.5], [336550.0, 7089450.0, -1.0, 0.3491, 1.5, 5, 22, 6, 11, 4, 'Ghost', 2, 12, 10, 'Ghost', 1, 269899.49999999994], [336550.0, 7089450.0, 1.0, 0.326, 1.5, 5, 23, 6, 11, 4, 'Ghost', 2, 12, 10, 'Ghost', 1, 248070.0]], [[336550.0, 7089550.0, -7.0, 0.1494, 1.5, 6, 24, 7, 12, 5, 2, 3, 13, 11, 'Ghost', 0, -30000.0], [336550.0, 7089550.0, -5.0, 0.1598, 1.5, 6, 25, 7, 12, 5, 2, 3, 13, 11, 'Ghost', 0, -30000.0], [336550.0, 7089550.0, -3.0, 0.2061, 1.5, 6, 26, 7, 12, 5, 2, 3, 13, 11, 'Ghost', 1, 134764.5], [336550.0, 7089550.0, -1.0, 0.2554, 1.5, 6, 27, 7, 12, 5, 2, 3, 13, 11, 'Ghost', 1, 181353.0], [336550.0, 7089550.0, 1.0, 0.3218, 1.5, 6, 28, 7, 12, 5, 2, 3, 13, 11, 'Ghost', 1, 244101.0]], [[336550.0, 7089650.0, -5.0, 0.1334, 1.5, 7, 29, 'Ghost', 13, 6, 3, 'Ghost', 'Ghost', 12, 2, 0, -30000.0], [336550.0, 7089650.0, -3.0, 0.1711, 1.5, 7, 30, 'Ghost', 13, 6, 3, 'Ghost', 'Ghost', 12, 2, 0, -30000.0], [336550.0, 7089650.0, -1.0, 0.193, 1.5, 7, 31, 'Ghost', 13, 6, 3, 'Ghost', 'Ghost', 12, 2, 0, -30000.0], [336550.0, 7089650.0, 1.0, 0.2498, 1.5, 7, 32, 'Ghost', 13, 6, 3, 'Ghost', 'Ghost', 12, 2, 1, 176061.0]]] 

Deepest_Block_All_Columns = [] # Will have the lowest Z-value for each column. 
     for item in range(0,len(BlocksPerColumn)): 
      Deepest_Block_Column = [100] # Making sure that the z value at start is always lower. 
      for i in range(0,len(BlocksPerColumn[item])): 
       if BlocksPerColumn[item][i][2] < Deepest_Block_Column: 
        Deepest_Block_Column = BlocksPerColumn[item][i][2] 
      Deepest_Block_All_Columns += [Deepest_Block_Column] 
      Deepest_Block_Column = [100] 
     print Deepest_Block_All_Columns 

正如我收到一個結果:

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 

爲什麼我沒有得到-7.0(-7.0以來是最低的),爲什麼我收到的0:

[[-7.0],[ -7.0]........] 

我想每個項目的索引2(這是一個Z座標)的最低值。

+0

讓我重新考慮一下:您試圖在列表的列表中找到最低值?是否所有單元格都有效檢查?林不知道你是否要檢查這個結構的每個細胞,並比較它找到集合中的最低數字,或什麼? – Fallenreaper

+0

對於第一個問題是的。隨着PerColumn塊顯示(大約有7個列表,例如:[336350.0,7089650.0,-7.0,0.1665,1.5,1,1'Ghost',3,'Ghost','Ghost',' Ghost','Ghost',2,'Ghost',0,-30000.0]列表中的每個列表存在多個列表 [336350.0,7089650.0,-7.0,0.1665,1.5,1,1'Ghost',3, 'Ghost','Ghost','Ghost','Ghost',2,'Ghost',0,-30000.0]第二個索引(第三個位置)是一個z座標,你可以在這裏看到它的-7。 m試圖爲包含大約7個列表的列表中的所有列表找到一個最低的z值並將它們添加到Deepest_Block_All_Columns。 – AlmostGr

回答

1

首先你不會得到一個列表作爲結果。因爲每當你兩個列表的結果將是一個合併列表。 要獲得您應該做的清單列表Deepest_Block_All_Columns.append([Deepest_Block_Column]) 此外,您的代碼片段是正確的。當我運行它給我
[-7.0, -7.0, -5.0, -7.0, -5.0, -7.0, -5.0] 嘗試追加列表如上所示,可能是有幫助的。

注:,這實際上並不回答您的問題 ,我可以看到你正在服用的列表進行比較的Deepest_Block_Column然後把它作爲一個簡單的變量,因爲你已經採取Deepest_Block_All_Columns作爲一個列表中,當append()那變量,然後它將被添加到該列表 因此,可能正在做的改變可能會有所幫助。請告訴我,這些更改是否有幫助

+0

非常感謝。 – AlmostGr

相關問題