使用Python如何通过有序子集匹配减少列表列表[[..],[..],..]?在这个问题的上下文中,列表L是列表M的子集如果M包含L的所有成员,并以相同的顺序。例如,列表[1,2]是列表[1,2,3]的子集,但不是列表[2,1,3]的子集。示例输入:a.[[1,2,4,8],[1,2,4,5,6],[1,2,3],[2,3,21],[1,2,3,4],[1,2,3,4,5,6,7]]b.[[2,16,17],[1,2,3,4,5,6,7],[1],[1,2,3,4],[1,2],[17,18,19,22,41,48],[2,3],[1,2,3],[50,69],[1,2,3],[2,3
我想将非平面结构序列化为一个平面对象。这是我收到的API调用的示例(不幸的是我无法控制它):{"webhookEvent":"jira:issue_updated","user":{"id":2434,"name":"Ben",},"issue":{"id":"33062","key":"jira-project-key-111","fields":{"summary":"Theweekahead",},"changelog":{"id":"219580","items":[{"field":"status","fieldtype":"jira","from":"10127","fro