[Leetcode] - Remove Nth Node From End of List

문제링크: https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/?envType=daily-question&envId=2024-03-03

Maximum Odd Binary Number - LeetCode

 

풀이

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode prev = head;
        ListNode after = head;

        ListNode cntNode = head;
        int cnt = 0;

        while(cntNode != null) {
            cnt += 1;
            cntNode = cntNode.next;
        }

        n = cnt - n;

        if(n == 0) {
            return head.next;
        }

        for(int i = 0; i <= n; i++) {
            after = after.next;
        }

        for(int i = 0; i <= n-2; i++) {
            prev = prev.next;
        }
        
        prev.next = after;
        return head;
    }
}