Haniel的博客

## Problem Given a linked list, swap every two adjacent nodes and return its head. You may **not** modify the values in the list's nodes, only nodes itself may be changed. 我的博客: [hanielxx.com](https://hanielxx.com)

前言 刚决定以后将博客同步到csnd和简书，考虑到将以前的博客迁移到这边比较麻烦，就不迁移了。只同步以后的博客。 所以，如果想了解前面的博客内容，请移步原博客 Problem Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a +...

Problem Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to the length of the linked list. If the num...

Problem Given a linked list, remove the n-th node from the end of list and return its head. Note: Given n will always be valid. Examples: **Input:**1->2->3->4->5, and n = 2. After removing...

Problem Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.