void test_removeNthFromEnd() { { int a[] = { 1, 2 };// { 0, 1, 3, 5 }; ListNode *p = createList(a, sizeof(a) / sizeof(a[0])); printList(p); p = removeNthFromEnd(p, 1); printList(p); freeList(p); } { int a[] = { 1, 2 };// { 0, 1, 3, 5 }; ListNode *p = createList(a, sizeof(a) / sizeof(a[0])); printList(p); p = removeNthFromEnd(p, 2); printList(p); freeList(p); } { int a[] = { 0, 1, 3, 5 };// { }; ListNode *p = createList(a, sizeof(a) / sizeof(a[0])); printList(p); p = removeNthFromEnd(p, 5); printList(p); freeList(p); } }
int main(int argc, char* argv[]) { testisPalindrome(); ListNode *list = NULL;//(ListNode*)malloc(sizeof(ListNode)); createList(&list); ListNode *list3 = reverseList_recursive(list); printList(list3); return 0; testlengthLongestSubString(); //tetestreverseString(); //testPrintParent();st_sqrt2(); removeNthFromEnd(list, 4); //ListNode *list2 = reverseList(list); //removeOneNode(&list2, 11); /* ListNode *list3 = reverseBetween(list, 2,5); */ testreverseString4(); testcountNumWords(); testreplaceSpace(); testisSubstring(); // test_atoi_(); test_isPrime(); test_pow_(); test_typedef(); test_addwithBinary(); test_numZeros(); test_fibonacci(); test_sum2value(); test_palindrom(); test_bestStock(); test_closeSQRT(); test_reverse_int(); }
int main(int argc, char *argv[]) { ListNode head(0); ListNode *h = &head; removeNthFromEnd(h, 1); return 0; }
int main(int argc, char const *argv[]) { List L1, L2, L; L1 = CreateEvenList(1); L2 = CreateOddList(10); PrintList(L1); PrintList(L2); L2 = removeNthFromEnd(L2, 2); PrintList(L2); return 0; }
int main(void){ struct ListNode *head = (struct ListNode *)malloc(sizeof(struct ListNode)); struct ListNode *current = head; struct ListNode *result; int i; for(i = 0;i < 10;i++){ current->val = i; current->next = (struct ListNode *)malloc(sizeof(struct ListNode)); current = current->next; } current->val = i; current->next = NULL; int n = 4; result = removeNthFromEnd(head,n); return 0; }
int main (int argc, char **argv) { int i; int val[] = {1,2,14,17,18,5,4,6,14,32,41,1432,1,453,2,4321,51,6541,41,146}; //int val[] = {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}; struct ListNode *head = NULL; head = (struct ListNode*)calloc(1, sizeof(struct ListNode)); head->val = 1; head->next = NULL; for(i = 0; i < 20; i++) { list_add_tail(head, val[i]); } print_list(head); head = removeNthFromEnd(head, 21); printf("removed:\n"); print_list(head); return 0; }
void test() { ListNode node(1); ListNode *result = removeNthFromEnd(&node, 1); }