Skip to content

[Leetcode] 24. Swap Nodes in Pairs โ€‹

Problem โ€‹

๋ฌธ์ œ ๋งํฌ

์„œ๋กœ ์ธ์ ‘ํ•˜๋Š” ํ™€์ˆ˜๋ฒˆ์งธ์™€ ์ง์ˆ˜๋ฒˆ์งธ์˜ ๋…ธ๋“œ์˜ ์œ„์น˜๋ฅผ ์„œ๋กœ ์ž๋ฆฌ ์ด๋™ ์‹œํ‚ค๋Š” ๋ฌธ์ œ

Solution โ€‹

  1. ๋นˆ ๋…ธ๋“œ๋ฅผ ๋งŒ๋“ค๊ณ  head๋ฅผ ๊ฐ€๋ฅดํ‚ค๋„๋กํ•œ๋‹ค.
  2. ์ฒซ๋ฒˆ์งธ์™€ ๋‘๋ฒˆ์งธ ๋…ธ๋“œ๋ฅผ swapํ•˜๊ธฐ ์œ„ํ•ด์„œ๋Š” ์ฒซ๋ฒˆ์งธ์™€ ๋‘๋ฒˆ์งธ, ์„ธ๋ฒˆ์งธ ๋…ธ๋“œ๋ฅผ ์ €์žฅํ•ด๋‘๊ณ  ์ฒซ๋ฒˆ์งธ๊ฐ€ ์„ธ๋ฒˆ์งธ๋ฅผ ๊ฐ€๋ฅดํ‚ค๊ณ  ๋‘๋ฒˆ์งธ๊ฐ€ ์ฒซ๋ฒˆ์งธ๋ฅผ ๊ฐ€๋ฅดํ‚ค๊ฒŒ ๋งŒ๋“ ๋‹ค. ๋งˆ์ง€๋ง‰์œผ๋กœ ์ด์ „ ๋…ธ๋“œ๊ฐ€ ์ฒซ๋ฒˆ์งธ๊ฐ€ ์•„๋‹Œ ๋‘๋ฒˆ์งธ๋ฅผ ๊ฐ€๋ฅดํ‚ค๋„๋กํ•œ๋‹ค.

JS Code โ€‹

javascript
/**
 * Definition for singly-linked list.
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} head
 * @return {ListNode}
 */
var swapPairs = function(head) {
    
    const preHead = new ListNode(0,head)
    let rear = preHead
    
    while(rear.next?.next) {
        
        const third = rear.next.next.next
        const second = rear.next.next
        const first = rear.next
        
        first.next = third
        second.next = first
        rear.next = second
        
        rear = rear.next.next
    }
    
    
    return preHead.next
};