In　this　paper,　we　propose　a　hybrid　Bregman　alternating　direction　method　of　multipliers　for　solving　the　linearly　constrained　difference-of-convex　problems　whose　objective　can　be　written　as　the　sum　of　a　smooth　convex　function　with　Lipschitz　gradient,　a　proper　closed　convex　function　and　a　continuous　concave　function.　At　each　iteration,　we　choose　either　subgradient　step　or　proximal　step　to　evaluate　the　concave　part.　Moreover,　the　extrapolation　technique　was　utilized　to　compute　the　nonsmooth　convex　part.　We　prove　that　the　sequence　generated　by　the　proposed　method　converges　to　a　critical　point　of　the　considered　problem　under　the　assumption　that　the　potential　function　is　a　Kurdyka-Lojasiewicz　function.　One　notable　advantage　of　the　proposed　method　is　that　the　convergence　can　be　guaranteed　without　the　Lischitz　continuity　of　the　gradient　function　of　concave　part.　Preliminary　numerical　experiments　show　the　efficiency　of　the　proposed　method.