frank on Nostr: 请问三种遍历方式，哪一种时间复杂度最低？

{ "id": "9ea9ccfd50a8457ecd8cf7013dc48bea97fc2f9602bbd6f6c7070c99516e77f9", "pubkey": "a62495388e63390bcda5df2565ec6b484ea8fdf8d83ab65b720ccbea9a1ade39", "created_at": 1675833220, "kind": 1, "tags": [ [ "e", "be8b9a3596bcd5ece10504d6c0be99582cc6ad04dc1c66b4c3d7d68b4dda2849", "" ], [ "e", "d597f244bb5c7bd02a51e5d75eb987fbdc56b719e1f0e9f757407825a88d2506" ], [ "p", "5c10ed0678805156d39ef1ef6d46110fe1e7e590ae04986ccf48ba1299cb53e2" ] ], "content": "请问三种遍历方式，哪一种时间复杂度最低？", "sig": "84aff073c14d919d223e1b8f5bfe845ccfa67ebd58d94632dfe21c090b1ad620e02b55b8e96380affea5d79d4bf7a3cc563c829d5233da48e53547451f211200" }