C++ (Cpp) Solution::FindKthToTail Examples

Example #1

File: KthNode.cpp Project: BeyondCC/LeetCode

int main(int argc, char *argv[]) {
    ListNode* node = new ListNode(1);
    ListNode* node1 = new ListNode(2);
    ListNode* node2 = new ListNode(3);
    ListNode* node3 = new ListNode(4);
    ListNode* node4 = new ListNode(5);

    node->next = node1;
    node1->next = node2;
    node2->next = node3;
    node3->next = node4;

    Solution s;
    s.FindKthToTail(node, 1);
    return 0;
}

Example #2

File: solution.cpp Project: sharpdeep/coding-challenge

int main()
{

	ListNode* head = (ListNode*)malloc(sizeof(struct ListNode));
	head->val = 0;
	ListNode* p = head;
	for(int i = 1; i < 10; i++){
		ListNode* node = (ListNode*)malloc(sizeof(struct ListNode));
		node->val = i;
		p->next = node;
		p = p->next;
	}

	Solution s = Solution();
	ListNode* result = s.FindKthToTail(head,2);
	cout<<result->val<<endl;
}