剑指offer个人答案(Java版)-3

最新推荐文章于 2024-10-01 23:05:47 发布

Ymq.

最新推荐文章于 2024-10-01 23:05:47 发布

阅读量120

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/qq_38556217/article/details/118027749

版权

文章目录

17. 矩阵中的路径

class Solution {
    public int[] printNumbers(int n) {
       int[] data = new int[(int)Math.pow(10, n)-1];
        for (int i = 0; i < data.length; i++) data[i] = i+1;
        return data;
    }
}

18. 矩阵中的路径

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode deleteNode(ListNode head, int val) {
        if (head.val == val) return head.next;
        ListNode pre = head, cur = head.next;
        while(cur != null && cur.val != val){
            pre = cur;
            cur = cur.next;
        }
        // 节点删除
        if (cur != null) pre.next = cur.next;
        return head;
    }
}

21. 调整数组顺序使奇数位于偶数前面

class Solution {
    public int[] exchange(int[] nums) {
         int l=0, r=nums.length-1;
        while (l<r) {
            if (nums[l]%2==0 && nums[r]%2!=0){
                int data = nums[r];
                nums[r] = nums[l];
                nums[l] = data;
                l++;
                r--;
            }
            else if (nums[l]%2!=0) l++;
            else if (nums[r]%2==0) r--;
        }
        return nums;
    }
}

22. 链表中倒数第k个节点

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode getKthFromEnd(ListNode head, int k) {
        ListNode l=head, r=head;
        for (int i = 0; i < k; i++) r=r.next;
        while (r!=null) {
            l = l.next;
            r = r.next;
        }
        return l; 
    }
}