qq_31361913的博客

public class Solution { public String replaceSpace(StringBuffer str) { int count = 0; int oldLength = str.length(); for(int i = 0; i < oldLength; i++){ if(str.charAt(i) == ' '){ count++; .

从后往前遍历两个String，把对应位的和放入StringBuilder。循环结束后检查是否还有进位，有的话再添加一位1。将StringBuilder反转后再转化成String输出。代码如下：class Solution { public String addStrings(String num1, String num2) { int i = num1.length() - 1, j = num2.length() - 1; StringBuilder res

这道题就是用left和right两个指针去遍历String就好了。还有就是记住Character的几个API：isLetterOrDigit() 和toLowerCase()。代码如下：class Solution { public boolean isPalindrome(String s) { int left = 0, right = s.length() - 1; while(left < right){ while(le.

public class Solution { public String rightShift(String input, int n) { // Write your solution here if(input.length() == 0){ return input; } char[] array = input.toCharArray(); int k = n % array.length; reverse(array, 0, ar.

首先对数组进行排序，排序后固定一个数 nums[i]，再使用左右指针指向 nums[i]后面的两端，数字分别为 nums[L] 和 nums[R]，计算三个数的和 sum 判断是否满足为 0，满足则添加进结果集。如果 nums[i]大于 0，则三数之和必然无法等于 0，结束循环如果 nums[i] == nums[i-1]，则说明该数字重复，会导致结果重复，所以应该跳过当 sum == 0 时，nums[L] == nums[L+1] 则会导致结果重复，应该跳过，L++当 sum == 0时，nu.

public class Solution { public int[] reorder(int[] array) { // Write your solution here if (array.length % 2 == 1) { reorder(array, 0, array.length - 2); } else { reorder(array, 0, array.length - 1); } return array; } private void reo.

这道题其实是151的基础。代码如下：class Solution { public void reverseWords(char[] s) { reverse(s, 0, s.length - 1); int head = 0, tail = 0; for(int i = 0; i < s.length; i++){ if(s[i] != ' ' && (i == 0 || s[i - 1] == '

class Solution { public String reverseWords(String s) { // Remove the spaces String str = removeSpace(s); char[] words = str.toCharArray(); // Reverse the whole sentence reverse(words, 0, words.length - 1); ...

Iterative Approach class Solution { public void reverseString(char[] s) { int left = 0, right = s.length - 1; while(left < right){ char temp = s[left]; s[left] = s[right]; s[right] = temp;

class Solution { public String removeVowels(String S) { StringBuilder sb = new StringBuilder(); for(char c: S.toCharArray()){ if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u'){ continue; .

这道题虽然是简单题，但是有些启发价值的。他的解法和第203题非常类似，唯一区别在于没有用dummyHead。排除linkedlist为空或者只有一个node的两种corner case； 再设置两个prev和curr两个指针分别指向head和head.next； 当curr不为空时：如果curr.val == prev.val, 则perv.next = curr.next; 否则 prev = curr; 两种情况都需要curr = curr.next；我自己的理解是prev的物理意义是无重复v

首先加一个假头，然后双指针prev和curr。主要考虑两种情况：1 -> 2, 1 -> 1 -> 2。https://leetcode.wang/leetCode-82-Remove-Duplicates-from-Sorted-ListII.html/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * L

https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii/solution/shan-chu-pai-xu-shu-zu-zhong-de-zhong-fu-xiang-i-2/class Solution { public int removeDuplicates(int[] nums) { int slow = 0; for(int fast = 0; fast <

class Solution { public int removeDuplicates(int[] nums) { int slow = 0; for(int fast = 0; fast < nums.length; fast++){ if(slow == 0 || nums[fast] > nums[slow - 1]){ nums[slow++] = nums[fast]; .