{"id":1611,"date":"2025-09-29T15:56:55","date_gmt":"2025-09-29T08:56:55","guid":{"rendered":"https:\/\/kienthucmo.com\/?p=1611"},"modified":"2025-11-05T23:42:49","modified_gmt":"2025-11-05T16:42:49","slug":"xoa-phan-tu-trong-set-bang-python","status":"publish","type":"post","link":"https:\/\/kienthucmo.com\/vi\/xoa-phan-tu-trong-set-bang-python\/","title":{"rendered":"X\u00f3a ph\u1ea7n t\u1eed trong Set b\u1eb1ng Python"},"content":{"rendered":"\n

Set (t\u1eadp h\u1ee3p) trong Python l\u00e0 m\u1ed9t c\u1ea5u tr\u00fac d\u1eef li\u1ec7u r\u1ea5t h\u1eefu \u00edch khi m\u00ecnh c\u1ea7n l\u01b0u nhi\u1ec1u ph\u1ea7n t\u1eed kh\u00f4ng tr\u00f9ng l\u1eb7p<\/strong> v\u00e0 c\u1ea7n ki\u1ec3m tra s\u1ef1 t\u1ed3n t\u1ea1i (membership) nhanh. V\u00ec set l\u00e0 unordered<\/strong> v\u00e0 ph\u1ea7n t\u1eed ph\u1ea3i hashable<\/strong>, thao t\u00e1c v\u1edbi set kh\u00e1c so v\u1edbi list hay tuple \u2014 \u0111\u1eb7c bi\u1ec7t l\u00e0 vi\u1ec7c x\u00f3a ph\u1ea7n t\u1eed<\/strong>. Vi\u1ec7c bi\u1ebft r\u00f5 c\u00e1c ph\u01b0\u01a1ng ph\u00e1p x\u00f3a, h\u1eadu qu\u1ea3 v\u00e0 c\u00e1c l\u01b0u \u00fd gi\u00fap m\u00ecnh tr\u00e1nh bug (v\u00ed d\u1ee5 KeyError), ti\u1ebft ki\u1ec7m b\u1ed9 nh\u1edb v\u00e0 vi\u1ebft code an to\u00e0n h\u01a1n trong m\u00f4i tr\u01b0\u1eddng th\u1ef1c t\u1ebf.<\/p>\n\n\n\n

B\u00e0i vi\u1ebft n\u00e0y s\u1ebd \u0111i s\u00e2u t\u1eebng ph\u01b0\u01a1ng ph\u00e1p x\u00f3a ph\u1ea7n t\u1eed trong set: c\u00fa ph\u00e1p, v\u00ed d\u1ee5, ph\u00e2n t\u00edch ph\u1ee9c t\u1ea1p t\u00ednh to\u00e1n, \u01b0u\/nh\u01b0\u1ee3c \u0111i\u1ec3m, c\u00e1c pattern an to\u00e0n, v\u00e0 c\u00e1c t\u00ecnh hu\u1ed1ng n\u00ean d\u00f9ng t\u1eebng c\u00e1ch.<\/p>\n\n\n\n

1. T\u1ed5ng quan v\u1ec1 Set trong Python \u2014 nh\u1eefng \u0111\u1eb7c \u0111i\u1ec3m quan tr\u1ecdng li\u00ean quan \u0111\u1ebfn x\u00f3a ph\u1ea7n t\u1eed<\/h2>\n\n\n\n

Tr\u01b0\u1edbc khi x\u00f3a, m\u00ecnh c\u1ea7n nh\u1edb v\u00e0i \u0111\u1eb7c t\u00ednh c\u1ed1t l\u00f5i c\u1ee7a set:<\/p>\n\n\n\n

    \n
  • Unordered<\/strong>: Set kh\u00f4ng c\u00f3 th\u1ee9 t\u1ef1 c\u1ed1 \u0111\u1ecbnh \u2014 kh\u00f4ng th\u1ec3 x\u00f3a \u201cph\u1ea7n t\u1eed th\u1ee9 i\u201d gi\u1ed1ng nh\u01b0 index \u1edf list.<\/li>\n\n\n\n
  • No duplicates<\/strong>: M\u1ed7i gi\u00e1 tr\u1ecb ch\u1ec9 xu\u1ea5t hi\u1ec7n m\u1ed9t l\u1ea7n \u2014 x\u00f3a gi\u00e1 tr\u1ecb s\u1ebd lo\u1ea1i t\u1ea5t c\u1ea3 l\u1ea7n xu\u1ea5t hi\u1ec7n (nh\u01b0ng trong set v\u1ed1n ch\u1ec9 c\u00f3 m\u1ed9t).<\/li>\n\n\n\n
  • Hashable elements<\/strong>: C\u00e1c ph\u1ea7n t\u1eed ph\u1ea3i hashable (v\u00ed d\u1ee5 numbers, strings, tuples of hashables). Kh\u00f4ng th\u1ec3 ch\u1ee9a list, dict (kh\u00f4ng hashable).<\/li>\n\n\n\n
  • Mutable<\/strong>: Set l\u00e0 mutable \u2014 c\u00f3 th\u1ec3 th\u00eam\/x\u00f3a ph\u1ea7n t\u1eed (kh\u00f4ng gi\u1ed1ng frozenset).<\/li>\n<\/ul>\n\n\n\n

    Hi\u1ec3u r\u00f5 \u0111i\u1ec1u n\u00e0y gi\u00fap ch\u1ecdn ph\u01b0\u01a1ng ph\u00e1p x\u00f3a ph\u00f9 h\u1ee3p: ta kh\u00f4ng x\u00f3a theo index, m\u00e0 x\u00f3a theo gi\u00e1 tr\u1ecb ho\u1eb7c x\u00f3a to\u00e0n b\u1ed9.<\/p>\n\n\n\n

    2. C\u00e1c ph\u01b0\u01a1ng th\u1ee9c c\u01a1 b\u1ea3n \u0111\u1ec3 x\u00f3a ph\u1ea7n t\u1eed (remove, discard, pop, clear)<\/h2>\n\n\n\n

    2.1 remove(elem)<\/code><\/h3>\n\n\n\n
      \n
    • M\u1ee5c \u0111\u00edch:<\/strong> X\u00f3a ph\u1ea7n t\u1eed c\u00f3 gi\u00e1 tr\u1ecb elem<\/code>.<\/li>\n\n\n\n
    • H\u00e0nh vi:<\/strong> N\u1ebfu elem<\/code> t\u1ed3n t\u1ea1i \u2192 x\u00f3a; n\u1ebfu kh\u00f4ng t\u1ed3n t\u1ea1i \u2192 n\u00e9m KeyError<\/code>.<\/li>\n\n\n\n
    • Complexity (avg):<\/strong> O(1)<\/li>\n<\/ul>\n\n\n\n

      V\u00ed d\u1ee5:<\/p>\n\n\n\n

      <\/circle><\/circle><\/circle><\/g><\/svg><\/span>