A2460865183的博客

方法一：字符串库函数 class Solution { public String reverseLeftWords(String s, int n) { StringBuilder str = new StringBuilder(); str.append(s.substring(n)).append(s.substring(0, n)); return str.toString(); } }

方法一：库函数 class Solution { public String reverseWords(String s) { StringBuilder str = new StringBuilder(); String[] res = s.trim().split(" "); for (int i = res.length - 1; i >= 0; i--) { if(res[i].equals(""))

方法一：普通遍历 class Solution { public int[][] findContinuousSequence(int target) { List<int[]> res = new ArrayList<>(); for (int i = 1; i <= (target / 2) + 1; i++) { int sum = 0; for (int j = i; j <=

双指针 class Solution { public int[] twoSum(int[] nums, int target) { int i = 0, j = nums.length - 1, res; while (i < j) { res = nums[i] + nums[j]; if (res == target) return new int[]{nums[i], num

二分法变形 class Solution { public int missingNumber(int[] nums) { int left = 0, right = nums.length - 1; while (left <= right) { int middle = (left + right) / 2; if (nums[middle] > middle) right

方法一：普通遍历 class Solution { public int search(int[] nums, int target) { int count = 0; for(int num : nums){ if(num == target) count++; } return count; } } 方法二：二分法 class Solution { publi

方法一：Arrays.sort() package com.hc.ArrayAndString; import java.util.Arrays; import java.util.Comparator; public class Offer45 { public String minNumber(int[] nums) { String[] strs = new String[nums.length]; for (int i = 0; i < nums.l

方法一：冒泡排序 class Solution { public int majorityElement(int[] nums) { for (int i = nums.length - 2; i >= 0; i--) { for (int j = 0; j <= i; j++) { if (nums[j] > nums[j + 1]) { int temp = nums

方法一：设定边界 package com.hc.ArrayAndString; public class Offer29 { public int[] spiralOrder(int[][] matrix) { if (matrix.length == 0) return new int[0]; int left = 0, right = matrix[0].length - 1, top = 0, below = matrix.length

方法一：首尾双指针一 class Solution { public int[] exchange(int[] nums) { int end = nums.length - 1; for (int i = 0; i < nums.length; i++) { if (nums[i] % 2 == 0) { int j = end; for (j = end; j >

方法一：不考虑大数问题 class Solution { public int[] printNumbers(int n) { int num = (int) Math.pow(10, n) - 1; int[] numbers = new int[num]; for (int i = 1; i <= num; i++) { numbers[i - 1] = i; } return numb

方法一：利用旋转数组部分单调递增的特点。 class Solution { public int minArray(int[] numbers) { if (numbers.length == 1) return numbers[0]; for (int i = 1; i < numbers.length; i++) { if (numbers[i] < numbers[i - 1])

class Solution { public String replaceSpace(String s) { s = s.replace(" ", "%20"); return s; } }

方法一：采用二分查找法 class Solution { public boolean findNumberIn2DArray(int[][] matrix, int target) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return false; for (int i = 0; i < matrix.length; i++) {