leetcode Submission Details

代码：

 #include<iostream>
 #include<vector>

 using namespace std;

  struct ListNode {
      int val;
      ListNode *next;
      ListNode(int x) : val(x), next(NULL) {}
  };

  ListNode* rotateRight(ListNode* head, int k) {
      if (head == NULL)
          return head;
      ListNode * p = head;
      int i = ;
      while (p->next != NULL)
      {
          p = p->next;
          i++;
      }
      ListNode * tail = p;
      int L = i;
      cout << "L = " << L << endl;
      k = L - k%L;
      cout << "K = " << k << endl;
      if (k == L)
          return head;
      i = ;
      p = head;
      while (i != k)
      {
          p = p->next;
          i++;
      }
      cout << "p ="<<p->val << endl;
      ListNode *newHead = p->next;
      p->next = NULL;
      tail->next = head;
      return newHead;
  }

 int main()
 {
     ListNode * head = new ListNode();
     ListNode *p = head;
     for (int i = ; i <= ; i++)
     {
         p->next = new ListNode(i);
         p = p->next;
     }
     p = NULL;
     for (ListNode * temp = head; temp != NULL; temp = temp->next)
         cout << temp->val << endl;
     ListNode * newHead = rotateRight(head, );
     cout << "-----------------------------------------" << endl;
     for (ListNode * temp = newHead; temp != NULL; temp = temp->next)
         cout << temp->val << endl;
 }