摘要： package leetcode; import java.util.Stack; public class offer_58_1 { /* public String reverseWords(String s) { //先翻转整体再翻转局部 StringBuffer sb=new StringB 阅读全文

摘要： package leetcode; public class offer_57 { public int[] twoSum(int[] nums, int target) { int[] arr=new int[2]; int left=0; int right=nums.length-1; whi 阅读全文

摘要： package leetcode; public class offer_21 { public int[] exchange(int[] nums) { int left=0; int right=nums.length-1; int temp; while(left<right) { //如果是 阅读全文