JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;

JamesJi9277

public class Solution{
	public int kthtoLast(LinkedListNode head, int k){
		if (k < 0|| head == null)
			return -1;
		LinkedListNode p1 = head;
		LinkedListNode p2 = head;
		//moving p2 to reach the position length - k.
		for(int i = 0; i< k - 1; i++)
		{
			p2 = p2.next;