Skip to main content
 首页 » 编程设计

python之如何在数据框中存储的一系列数字中找到所有可能的女儿

2025年02月15日20xxx_UU

我有一个 python 数据框,其中一个列(例如 column1)包含一系列数字。我必须提到的是,这些数字中的每一个都是细胞突变的结果,因此编号为 n 的单元格偏离为具有以下数字的两个单元格:2*n 和 2* n+1。我想在此列中搜索以查找与特定编号 k 的女儿对应的所有行。我的意思是在它们的行中包含所有可能的 {2*k, 2*k+1, 2*(2*k), 2*(2*k+1), ... } 第 1 列。我不想使用树结构,我该如何解决?谢谢

请您参考如下方法:

这两个序列看起来像 binary expansion starts with 10 的数字以及 binary expansion starts with 11 的号码.

两个序列都可以直接找到:

import math 
 
def f(n=2): 
    while True: 
        yield int(n + 2**math.floor(math.log(n,2))) 
        n += 1 
 
def g(n=2): 
    while True: 
        yield int(n + 2 * 2**math.floor(math.log(n,2))) 
        n += 1 
 
a, b = f(), g() 
print [a.next() for i in range(15)] 
print [b.next() for i in range(15)] 
>>> [4, 5, 8, 9, 10, 11, 16, 17, 18, 19, 20, 21, 22, 23, 32] 
>>> [6, 7, 12, 13, 14, 15, 24, 25, 26, 27, 28, 29, 30, 31, 48] 

编辑:

对于任意起点,您可以执行以下操作,我认为这符合您的标准。

import Queue 
 
def f(k): 
    q = Queue.Queue() 
    q.put(k) 
 
    while not q.empty(): 
        p = q.get() 
        a, b = 2*p, 2*p+1 
        q.put(a) 
        q.put(b) 
        yield a 
        yield b 
 
a = f(4) 
print [a.next() for i in range(16)] 
>>> [8, 9, 16, 17, 18, 19, 32, 33, 34, 35, 36, 37, 38, 39, 64, 65] # ... 
 
a = f(5) 
print [a.next() for i in range(16)] 
>>> [10, 11, 20, 21, 22, 23, 40, 41, 42, 43, 44, 45, 46, 47, 80, 81] # ... 

根据 OEIS 检查这些序列:

f(2) - Starting 10  - A004754 
f(3) - Starting 11  - A004755 
f(4) - Starting 100 - A004756 
f(5) - Starting 101 - A004756 
f(6) - Starting 110 - A004758 
f(7) - Starting 111 - A004759 
... 

这意味着你可以简单地做:

import math 
 
def f(k, n=2): 
    while True: 
        yield int(n + (k-1) * 2**math.floor(math.log(n, 2))) 
        n+=1 
 
for i in range(2,8): 
    a = f(i) 
    print i, [a.next() for j in range(16)] 
 
>>> 2 [4, 5, 8, 9, 10, 11, 16, 17, 18, 19, 20, 21, 22, 23, 32] 
>>> 3 [6, 7, 12, 13, 14, 15, 24, 25, 26, 27, 28, 29, 30, 31, 48] 
>>> 4 [8, 9, 16, 17, 18, 19, 32, 33, 34, 35, 36, 37, 38, 39, 64] 
>>> 5 [10, 11, 20, 21, 22, 23, 40, 41, 42, 43, 44, 45, 46, 47, 80] 
>>> 6 [12, 13, 24, 25, 26, 27, 48, 49, 50, 51, 52, 53, 54, 55, 96] 
>>> 7 [14, 15, 28, 29, 30, 31, 56, 57, 58, 59, 60, 61, 62, 63, 112] 
# ... where the first number is shown for clarity.