void testcases()
{
	int i,check;
	char *a,*op;

	for(i=0;i<11;i++)
	{
		struct sll *ihead,*ohead,*j;

		a=malloc_char(testDB[i].input);

		op=malloc_char(testDB[i].output);

		ihead=convert_to_list(a);

		ohead=convert_to_list(op);

		for(j=ihead;j!=NULL;j=j->ptr)
			printf("%d ",j->data);

		//for(j=ohead;j!=NULL;j=j->ptr)
			//printf("%d ",j->data); 

		check=ll_cmp(ihead,ohead);

		if(check==0)
			printf("passed\n");
		else 
			printf("failed\n");
	}
} 
示例#2
0
int main() {
  int a[] = {1, 2};
  ListNode* head = convert_to_list(a, sizeof(a) / sizeof(a[0]));

  Solution sol;
  sol.rotateRight(head, 3);
  return 0;
}
int main()
{
	int n, a, b;
	int arr[N];
	while (~scanf("%d %d %d", &n, &a, &b)) {
		int i;
		for (i = 0; i < n; ++i) {
			scanf("%d", &arr[i]);
		}

		struct ListNode * head = convert_to_list(arr, n);
		print_list(head);
		head = reverseBetween(head, a, b);
		print_list(head);
		free_list(head);
	}
}
void testcases()
{
	int i,check,op,b;
	char *a;

	for(i=0;i<11;i++)
	{
		struct sll *ihead,*ohead,*j;

		a=malloc_char(testDB[i].input);

		op=testDB[i].even_odd;

		b=even_odd_check(convert_to_list(a));

		check=a_cmp(b,op);

		if(check==0)
			printf("passed\n");
		else 
			printf("failed\n");
	}
} 
示例#5
0
bp::list find_indexes_result_get_indexes(find_indexes_result_entry &result)
{
	return convert_to_list(result.indexes);
}
示例#6
0
bp::list elliptics_id::list_id() const {
	return convert_to_list(m_id.id, sizeof(m_id.id));
}