KM
March 3, 2021, 6:25 p.m.

не получаеться добавить списки в списокб ошибка в петле

import numpy as np
from pprint import pprint
import collections
from itertools import chain
import pandas as pd
from itertools import islice
import time
from itertools import zip_longest

CATEGORIES = ["0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","R","S","T","U","V","W","X","Y","Z"]
KR8877J = [[0.002,0.006,0.004,0.045,0.002,0.017,0.006,0.077,0.001,0.035,0.042,0.005,0.004,0.039,0.001,0.002,0.001,0.008,0.058,0.352,0.002,0.007,0.017,0.004,0.007,0.007,0.007,0.004,0.005,0.009,0.089,0.036,0.053,0.041,0.004]etc

seq = (KR8877J, KR8877J_1, KR8877J_2, KR8877J_3, KR8877J_4, KR8877J_5, KR8877J_6)
seq2 = (KR8R544_1, KR8R544_2, KR8R544_3, KR8R544_4, KR8R544_5)
seq3 = (KR508WW_1, KR508WW_2, KR508WW_3, KR508WW_4, KR508WW_5, KR508WW_6, KR508WW_7, KR508WW_8)

if name == " main ":

  1. max_index = 0
  2. max_list_from_all_plates = []
  3.  
  4. threshold = 0.05
  5.  
  6. for single_lp in seq:
  7. maximum_plate_prob = []
  8. possible_plate_prob = []
  9. max_list = []
  10.  
  11. for sign in single_lp:
  12. high_indexes = []
  13. for prob_id in range(0,len(sign)):
  14. if threshold<sign[prob_id]:
  15. high_indexes.append([sign[prob_id], prob_id, CATEGORIES[prob_id]])
  16. max_list.append(high_indexes)
  17. max_list_from_all_plates.append(max_list)
  18.  
  19. lista = []
  20.  
  21.  
  22.  
  23. for single_lp in max_list_from_all_plates:
  24. suma = 0#bylo ok tylko dla maximum
  25. listy = []
  26.  
  27. lists = []
  28.  
  29. for sign in single_lp:
  30. #suma = 0
  31.  
  32.  
  33. #print(sign)
  34. Highest_score=0
  35. biglist = []
  36.  
  37. for b in range(0,len(sign)):
  38.  
  39. n = sign[b]
  40. b = 0
  41. b += b
  42.  
  43. if n[0]>Highest_score:
  44. Highest_score=n[0]
  45.  
  46. sum = 0
  47. for i in n[2]:
  48.  
  49. if i == (len(n)-1):
  50. sum = 0
  51.  
  52. for i in n:
  53.  
  54. sum += float(Highest_score)
  55. listy.extend(lists)
  56.  
  57. suma += Highest_score
  58.  
  59.  
  60. lists.append([Highest_score, i])
  61. listy.append(lists)
  62. lista.append(suma)
  63.  
  64. print("SINGLE LISTS", lists)
  65. print("SUMA", suma)
  66. print("Test", lists)
  67.  
  68.  
  69. print("Lista sum", lista)
  70. print("Test", listy)
  71.  
  72. ma = max(lista)
  73. print("mak", ma)
  74. mi = min(lista)

def mergeSort(lista):
if len(lista) > 1:
mid = len(lista) // 2
left = lista[:mid]
right = lista[mid:]

  1. mergeSort(left)
  2. mergeSort(right)
  3.  
  4. i = 0
  5. j = 0
  6. k = 0
  7.  
  8. while i < len(left) and j < len(right):
  9. if left[i] < right[j]:
  10. lista[k] = left[i]
  11. i += 1
  12. else:
  13. lista[k] = right[j]
  14. j += 1
  15. k += 1
  16.  
  17. while i < len(left):
  18. lista[k] = left[i]
  19. i += 1
  20. k += 1
  21.  
  22. while j < len(right):
  23. lista[k]=right[j]
  24. j += 1
  25. k += 1

mergeSort(lista)
print("list", lista)

вместо вывода [[0.389, ‘J’], [0.348, ‘J’], [0.499, ‘7’], [0.369, ‘8’], [0.365, ‘8’], [0.289, ‘R’], [0.342, ‘K’]] [[0.384, ‘J’], [0.387, ‘J’], [0.282, ‘7’], [0.239, ‘8’], [0.25, ‘8’], [0.256, ‘R’], [0.357, ‘K’]] [[0.391, ‘J’], [0.379, ‘J’], [0.458, ‘7’], [0.235, ‘8’], [0.289, ‘8’], [0.275, ‘R’], [0.378, ‘K’]]

[[0.401, ‘J’], [0.462, ‘7’], [0.422, ‘J’], [0.287, ‘8’], [0.271, ‘8’], [0.286, ‘R’], [0.377, ‘K’]]

[[0.382, ‘J’], [0.35, ‘J’], [0.517, ‘7’], [0.36, ‘8’], [0.259, ‘8’], [0.331, ‘R’], [0.36, ‘K’]]

[[0.391, ‘J’], [0.366, ‘J’], [0.299, ‘7’], [0.234, ‘8’], [0.269, ‘8’], [0.239, ‘R’], [0.3, ‘K’]]

у меня отдельные списки нп: Test [[0.352, ‘J’], [0.36, ‘J’], [0.627, ‘7’], [0.412, ‘8’], [0.258, ‘8’], [0.317, ‘R’], [0.383, ‘K’]] Test [[0.389, ‘J’], [0.348, ‘J’], [0.499, ‘7’], [0.369, ‘8’], [0.365, ‘8’], [0.289, ‘R’], [0.342, ‘K’]]

Test [[0.384, ‘J’], [0.387, ‘J’], [0.282, ‘7’], [0.239, ‘8’], [0.25, ‘8’], [0.256, ‘R’], [0.357, ‘K’]]

Test [[0.391, ‘J’], [0.379, ‘J’], [0.458, ‘7’], [0.235, ‘8’], [0.289, ‘8’], [0.275, ‘R’], [0.378, ‘K’]]

Test [[0.401, ‘J’], [0.462, ‘7’], [0.422, ‘J’], [0.287, ‘8’], [0.271, ‘8’], [0.286, ‘R’], [0.377, ‘K’]]

Test [[0.382, ‘J’], [0.35, ‘J’], [0.517, ‘7’], [0.36, ‘8’], [0.259, ‘8’], [0.331, ‘R’], [0.36, ‘K’]]

Test [[0.391, ‘J’], [0.366, ‘J’], [0.299, ‘7’], [0.234, ‘8’], [0.269, ‘8’], [0.239, ‘R’], [0.3, ‘K’]]

Заранее спасибо!

1

Do you like it? Share on social networks!

1
KM
  • March 5, 2021, 1:25 p.m.
  • The answer was marked as a solution.

решение:
с line 99:
listy = [] lista = []

  1. for single_lp in max_list_from_all_plates:
  2. suma = 0
  3. lists = []
  4.  
  5.  
  6. for sign in single_lp:
  7.  
  8.  
  9.  
  10. Highest_score=0
  11. biglist = []
  12.  
  13. for b in range(0,len(sign)):
  14.  
  15. n = sign[b]
  16. b = 0
  17. b += b
  18.  
  19. if n[0]>Highest_score:#znaleenie maksimum dla kazdego elementu
  20. Highest_score=n[0]
  21.  
  22. sum = 0
  23. for i in n[2]:
  24.  
  25. if i == (len(n)-1):
  26. sum = 0
  27. #print(i)
  28.  
  29.  
  30. for i in n:
  31. print(i, n)
  32. sum += float(Highest_score)
  33.  
  34.  
  35. suma += Highest_score
  36. lists.append([Highest_score, i])
  37.  
  38. lista.append(suma)
  39. listy.append(lists)
  40. listy.index()

    Comments

    Only authorized users can post comments.
    Please, Log in or Sign up
    • Last comments
    • Evgenii Legotckoi
      March 9, 2025, 9:02 p.m.
      К сожалению, я этого подсказать не могу, поскольку у меня нет необходимости в обходе блокировок и т.д. Поэтому я и не задавался решением этой проблемы. Ну выглядит так, что вам действитель…
    • VP
      March 9, 2025, 4:14 p.m.
      Здравствуйте! Я устанавливал Qt6 из исходников а также Qt Creator по отдельности. Все компоненты, связанные с разработкой для Android, установлены. Кроме одного... Когда пытаюсь скомпилиров…
    • ИМ
      Nov. 22, 2024, 9:51 p.m.
      Добрый вечер Евгений! Я сделал себе авторизацию аналогичную вашей, все работает, кроме возврата к предидущей странице. Редеректит всегда на главную, хотя в логах сервера вижу запросы на правильн…
    • Evgenii Legotckoi
      Oct. 31, 2024, 11:37 p.m.
      Добрый день. Да, можно. Либо через такие же плагины, либо с постобработкой через python библиотеку Beautiful Soup
    • A
      Oct. 19, 2024, 5:19 p.m.
      Подскажите как это запустить? Я не шарю в программировании и кодинге. Скачал и установаил Qt, но куча ошибок выдается и не запустить. А очень надо fb3 переконвертировать в html