leetcode刷题20天
160. Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins.
Example 1:
Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
Output: Reference of the node with value = 8
Input Explanation: The intersected node’s value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.
代码:
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
if(headA==null||headB==null)
return null;
ListNode p1 = headA;
ListNode p2 = headB;
int len1 = 0,len2=0;
while(p1!=null) {
p1 = p1.next;
len1++;
}
p1 = headA;
while(p2!=null) {
p2 = p2.next;
len2++;
}
p2 = headB;
int count = 0;
if(len1>len2) {
for(int i = 0;i<len1-len2;i++)
p1=p1.next;
}
else
{
for(int i = 0;i<len2-len1;i++)
p2=p2.next;
}
while(p1!=null&&p2!=null&&p1!=p2) {
p1 = p1.next;
p2 = p2.next;
}
return p1;
}
}
- Two Sum II - Input array is sorted
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.
Note:
Your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution and you may not use the same element twice.
Example:
Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
代码:
class Solution {
public int[] twoSum(int[] numbers, int target) {
int l = 0;
int r = numbers.length-1;
while(l<r) {
int temp = numbers[l]+numbers[r];
if(target==temp) {
l++;
r++;
return new int[]{l,r};
}
if(target<temp){
r--;
}
else
l++;
}
return null;
}
}