qq_41827785的博客

public static void main(String[] args) { int b=99; int a=10; System.out.println("a="+a); System.out.println("b="+b); a=a^b;//^异或 b=a^b; a=a^b; System.out.println("a="+a); System.out.println("b="+b); }

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public int[] reversePrint(ListNode head) { Stack s=new Stack();

class Solution { public String replaceSpace(String s) { int len=s.length();//String长度 char []a=new char[len*3];//3倍长度确保够用 int j=0;//j为新数组下标 for(int i=0;i<len;i++){ char c=s.charAt(i);//String转char

import java.util.*;public class Solution { /** * @param numbers int整型一维数组 * @param target int整型 * @return int整型一维数组 */ public int[] twoSum (int[] numbers, int target) { int len=numbers.length;//获取数组长度 int a[

HashMap<String , Integer> map = new HashMap<>(); map.put("a",1);//增 map.remove("a");//删 map.put("a",2);//改 map.containsKey("zuo");//查（是否存在）

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public boolean isPalindrome(ListNode A) { Stack s=new Stack();

import java.util.*;class Solution { public int findRepeatNumber(int[] nums) { HashSet<Integer> hm=new HashSet<>(); int len=nums.length; for(int i=0;i<len;i++){ if(!hm.contains(nums[i])){//nums[i]是

import java.util.*Stack s=new Stack();s.push(p.val);s.empty()while(!s.empty())s.pop();