【发布时间】:2020-03-01 03:13:03
【问题描述】:
如果我有这样的桌子
|---------------------|------------------|
| time | list of string |
|---------------------|------------------|
| 2019-06-18 09:05:00 | ['A', 'B', 'C']|
|---------------------|------------------|
| 2019-06-19 09:05:00 | ['A', 'C'] |
|---------------------|------------------|
| 2019-06-19 09:05:00 | ['B', 'C'] |
|---------------------|------------------|
| 2019-06-20 09:05:00 | ['C'] |
|---------------------|------------------|
| 2019-06-20 09:05:00 | ['A', 'B', 'C']|
|---------------------|------------------|
对于每一行,我想知道在当前时间戳之前有多少行对当前字符串列表具有至少一个公共值。
慢代码是这样的:
results = [] for i in range(len(df)):
current_t = df['time'].iloc[i]
current_string = df['list_of_string'].iloc[i]
df_before_t = df[df['time']<current_t]
cumm_count = 0
for row in df_before_t['list_of_string']:
if (set(current_string) & set(row)):
cumm_count += 1
results.append(cumm_count)
所以结果表是:
|---------------------|------------------|---------------------|
| time | list of string | result |
|---------------------|------------------|---------------------|
| 2019-06-18 09:05:00 | ['A', 'B', 'C']| 0 |
|---------------------|------------------|---------------------|
| 2019-06-19 09:05:00 | ['A', 'C'] | 1 |
|---------------------|------------------|---------------------|
| 2019-06-19 09:05:00 | ['D'] | 0 |
|---------------------|------------------|---------------------|
| 2019-06-20 09:05:00 | ['C'] | 2 |
|---------------------|------------------|---------------------|
| 2019-06-20 09:05:00 | ['A', 'B', 'C']| 2 |
|---------------------|------------------|---------------------|
我目前拥有的数据集比较大,我想获得帮助以快速处理这些数据。非常感谢!
【问题讨论】:
标签: string pandas match cumulative-sum