算法一百以内的素数
- struct prime_number_node
- {
- int prime_number;
- prime_number_node* next;
- };
- int calc_prime_number()
- {
- prime_number_node* list_head = new prime_number_node();
- list_head->next = NULL;
- list_head->prime_number = 2;
- prime_number_node* list_tail = list_head;
- for(int number = 3 ; number < 100 ; number++)
- {
- int remainder;
- prime_number_node* cur_node_ptr = list_head;
- while(cur_node_ptr != NULL)
- {
- remainder = number%cur_node_ptr->prime_number;
- if(remainder == 0)
- {
- break;
- }
- else
- {
- cur_node_ptr = cur_node_ptr->next;2
- }
- }
- if(remainder != 0)
- {
- prime_number_node* new_node_ptr = new prime_number_node();
- new_node_ptr->prime_number = number;
- new_node_ptr->next = NULL;
- list_tail->next = new_node_ptr;
- list_tail = list_tail->next//3
- }
- }
- int result = 0;
- while(list_head != NULL)
- {
- result++;
- prime_number_node* temp_ptr = list_head;
- list_head = list_head->next;
- delete temp_ptr//4
- }
- return result;
- }
来自 “ ITPUB博客 ” ，链接：https://blog.itpub.net/29012686/viewspace-1145119/ ，如需转载，请注明出处，否则将追究法律责任。
上一篇：
算法数字转化为字符串
下一篇：
算法求交集
请登录后发表评论
登录
全部评论
