剑指 Offer 52. 两个链表的第一个公共节点
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
ListNode l1=headA;
ListNode l2=headB;
//当无交点时,若长度相同,则一轮遍历完链表,两者同为null,退出循环
// 若长度不同,则第二轮遍历之后,两种同为null,退出循环
while(l1!=l2){
l1= l1==null?headB:l1.next;
l2= l2==null?headA:l2.next;
}
return l1;
}
}
剑指 Offer 21. 调整数组顺序使奇数位于偶数前面
//思路:双指针
class Solution {
public int[] exchange(int[] nums) {
int i=0;
int j=nums.length-1;
while(i<j){
if(nums[i]%2==0&&nums[j]%2!=0){
int temp=nums[i];
nums[i]=nums[j];
nums[j]=temp;
}else if(nums[i]%2==0&&nums[j]%2==0){
j--;
}else if(nums[i]%2!=0&&nums[j]%2!=0){
i++;
}else{
i++;
j--;
}
}
return nums;
}
}
剑指 Offer 57. 和为s的两个数字
方法一:
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] res=new int[2];
Set<Integer> set=new HashSet<>();
for(int i=0;i<nums.length;i++){
if(!set.contains(target-nums[i])){
set.add(nums[i]);
}else{
res[0]=nums[i];
res[1]=target-nums[i];
break;
}
}
return res;
}
}
方法二:双指针法
class Solution {
public int[] twoSum(int[] nums, int target) {
//利用递增排序的特点-->双指针法
int i=0;
int j=nums.length-1;
int[] res=new int[2];
while(i<j){
if(nums[i]+nums[j]>target){
j--;
}else if(nums[i]+nums[j]<target){
i++;
}else{
res[0]=nums[i];
res[1]=nums[j];
break;
}
}
return res;
}
}