In this paper, we provide spectral conditions for the existence of two edge-disjoint cycles and same length in a graph, which can be viewed as analogues Erd?s Posa's condition Erd?s' classic problem about maximum number edges graph without length, respectively. Furthermore, give to guarantee $k$ triangles graph.