leetcode 之Partition List（16）

ListNode *partionList(ListNode *head, int value)
      {
          ListNode left_dummy(-1);
          ListNode right_dummy(-1);

          auto left_cur = left_dummy.next;
          auto right_cur = right_dummy.next;
          for (ListNode *cur = head; cur != nullptr; cur = cur->next)
          {
              if (cur->val > value)
              {
                  left_cur->next = cur;
                  left_cur = cur;
              }
              else
              {
                  right_cur->next = cur;
                  right_cur = cur;
              }
          }

          left_cur->next = right_dummy.next;
          right_cur->next = nullptr;
          return left_dummy.next;
      }