剑指Offer之Java算法习题精讲链表与字符串及数组

2025-10-17 01:04:23

题目一

解法

/**
 * 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 removeElements(ListNode head, int val) {
        ListNode q = new ListNode(-1);
        ListNode a = q;
        q.next = head;
        while(q.next!=null){
            if(q.next.val==val){
                q.next = q.next.next;
            }else{
                q = q.next;
            }
        }
        return a.next;
    }
}

题目二

解法

class Solution {
    public boolean isIsomorphic(String s, String t) {
        if(s.length()!=t.length()){
            return false;
        }
        for(int i =0;i<s.length();i++){
            if(s.indexOf(s.charAt(i))!=t.indexOf(t.charAt(i))){
                return false;
            }
        }
        return true;
    }
}

题目三

解法

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public void deleteNode(ListNode node) {
        node.val = node.next.val;
        node.next = node.next.next;
    }
}

题目四

解法

class Solution {
    public boolean isAnagram(String s, String t) {
        if(s.length()!=t.length()) return false;
        ArrayList<Character> list1 = new ArrayList<>();
        ArrayList<Character> list2 = new ArrayList<>();
        for (int i = 0; i < s.length(); i++) {
            list1.add(s.charAt(i));
        }

        for (int i = 0; i < t.length(); i++) {
            list2.add(t.charAt(i));
        }
        Collections.sort(list1);
        Collections.sort(list2);
        for (int i = 0; i < list1.size(); i++) {
            if (list1.get(i)!=list2.get(i)) return false;
        }
        return true;
    }
}

//要熟悉API
class Solution {
    public boolean isAnagram(String s, String t) {
        if (s.length() != t.length()) {
            return false;
        }
        char[] str1 = s.toCharArray();
        char[] str2 = t.toCharArray();
        Arrays.sort(str1);
        Arrays.sort(str2);
        return Arrays.equals(str1, str2);
    }
}

题目五

解法

class Solution {
    public int missingNumber(int[] nums) {
        Arrays.sort(nums);
        for (int i = 0; i < nums.length; i++) {
            if(i!=nums[i]){
                return i;
            }
        }
        return nums.length;
    }
}

题目六

解法

class Solution {
    public boolean wordPattern(String pattern, String s) {
        String[] split = s.split(" ");
        if(split.length!=pattern.length()) return false;
        int q = 0;
        for(int i =0;i<split.length;i++){
           l: for(int w = 0;w<split.length;w++){
                if(split[w].equals(split[i])){
                   q = w;
                   break l;
                }
            }
            if(pattern.indexOf(pattern.charAt(i))!=q){
                return false;
            }
        }
        return true;
    }
}

到此这篇关于剑指Offer之Java算法习题精讲链表与字符串及数组的文章就介绍到这了,更多相关Java 链表内容请搜索我们以前的文章或继续浏览下面的相关文章希望大家以后多多支持我们！

剑指Offer之Java算法习题精讲数组与字符串题

题目一解法 class Solution { public int thirdMax(int[] nums) { Arrays.sort(nums); if(nums.length<3){ return nums[nums.length-1]; } int p = 1; for(int i =nums.length-2;i>=0;i--){ if(nums[i]==nums[i+1]){ }else{ ++p; if(p==3){ return nums[i]; } } } return n
剑指Offer之Java算法习题精讲数组与字符和等差数列

题目一解法 class Solution { public int[] relativeSortArray(int[] arr1, int[] arr2) { int[] arr = new int[1001]; int[] ans = new int[arr1.length]; int index = 0; for(int i =0;i<arr1.length;i++){ arr[arr1[i]]+=1; } for(int i = 0;i<arr2.length;i++){ while
剑指Offer之Java算法习题精讲数组与列表的查找及字符串转换

题目一解法 class Solution { public String toLowerCase(String s) { StringBuilder sb = new StringBuilder(); for(int i = 0;i<s.length();i++){ char ch = s.charAt(i); if('A'<=ch&&ch<='Z'){ ch = (char)(ch+32); } sb.append(ch); } return sb.toString(
剑指Offer之Java算法习题精讲字符串与二叉搜索树

题目一解法 class Solution { public boolean repeatedSubstringPattern(String a) { for (int i = 1; i <=a.length()/2 ; i++) { String s = a.substring(0, i); StringBuffer sb = new StringBuffer(); while (sb.length()<a.length()){ sb.append(s); } if(sb.toString(
剑指Offer之Java算法习题精讲数组与字符串

题目一解法 class Solution { public int findLengthOfLCIS(int[] nums) { if(nums.length==1) return 1; int fast = 1; int tmp = 1; int max = Integer.MIN_VALUE; while(fast<nums.length){ if(nums[fast]>nums[fast-1]){ tmp++; max = Math.max(max,tmp); }else{ max
剑指Offer之Java算法习题精讲二叉搜索树与数组查找

题目一解法 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; *
剑指Offer之Java算法习题精讲字符串操作与数组及二叉搜索树

题目一解法 class Solution { public String reverseOnlyLetters(String s) { char[] chars = s.toCharArray(); int left = 0; int right = chars.length-1; while(left<=right){ char tmp = 0; if(chars[left]>='a'&&chars[left]<='z'||(chars[left]>='A'&
剑指Offer之Java算法习题精讲N叉树的遍历及数组与字符串

题目一解法 /* // Definition for a Node. class Node { public int val; public List<Node> children; public Node() {} public Node(int _val) { val = _val; } public Node(int _val, List<Node> _children) { val = _val; children = _children; } }; */ class S
剑指Offer之Java算法习题精讲链表与字符串及数组

题目一解法 /** * 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 Soluti
剑指Offer之Java算法习题精讲链表专题篇

题目一解法 /** * 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 Solut
剑指Offer之Java算法习题精讲链表专项训练

题目一链表题--链表合并根据给定的两个升序链表合并为一个新的升序链表具体题目如下解法 /** * 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;
剑指Offer之Java算法习题精讲链表与数组专项训练

题目一数组题——查找目标值在给定的数组中查找指定的目标值,这里提供两种解法具体题目如下解法一 class Solution { public int[] twoSum(int[] nums, int target) { int[] a = {-1,-1}; for(int i = 0;i<nums.length-1;i++){ for(int j = i+1;j<nums.length;j++){ if(nums[i]+nums[j]==target){ a[0] = i; a[1]
剑指Offer之Java算法习题精讲链表与二叉树专项训练

题目一链表题——反转链表根据单链表的头节点head来返回反转后的链表具体题目如下解法 /** * 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;
剑指Offer之Java算法习题精讲二叉树与斐波那契函数

题目一解法 class Solution { public int fib(int n) { int[] arr = new int[31]; arr[0] = 0; arr[1] = 1; for(int i = 2;i<=n;i++){ arr[i] = arr[i-2]+arr[i-1]; } return arr[n]; } } 题目二解法 /** * Definition for a binary tree node. * public class TreeNode { * in
剑指Offer之Java算法习题精讲二叉树与N叉树

题目一解法 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; *
剑指Offer之Java算法习题精讲二叉树专题篇下

题目一解法 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; *
剑指Offer之Java算法习题精讲二叉树专题篇上

来和二叉树玩耍吧~ 题目一解法 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val

剑指Offer之Java算法习题精讲链表与字符串及数组

题目一

题目二

题目三

题目四

题目五

题目六

相关推荐

随机推荐