摘要： Given a linked list, remove the n-th node from the end of list and return its head. Example: Given linked list: 1->2->3->4->5, and n = 2. After removi 阅读全文

摘要： Write a program to find the node at which the intersection of two singly linked lists begins. Write a program to find the node at which the intersecti 阅读全文

摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up:Can you 阅读全文

摘要： Given a linked list, determine if it has a cycle in it. Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without usi 阅读全文

摘要： In a given integer array nums, there is always exactly one largest element. In a given integer array nums, there is always exactly one largest element 阅读全文

摘要： Given an array of integers nums, write a method that returns the "pivot" index of this array. Given an array of integers nums, write a method that ret 阅读全文

摘要： #include int main() { // 1. 初始化 int a0[5]; int a1[5] = {1, 2, 3}; // other element will be set as the default value // 2. 得到长度 int size = sizeof(a1) / sizeof(*a1); cout << ... 阅读全文