摘要: 拆分技术主要用于将一个链表分开,或者是按照一定的规律排列完再合并为一条链表。下面是最简单的一种a,b成对出现#include #include typedef struct Node{ int content; struct Node* next;}LNode;init(LNode** head){ *head = (LNode*)malloc(sizeof(LNode)); (*head)->content = 0; (*head)->next = NULL;}insert(LNode* head, int num){ LNode* newNode = (... 阅读全文
posted @ 2014-03-18 15:21 yutoulck 阅读(285) 评论(0) 推荐(0) 编辑
摘要: #include #include find(int num[], int n){ int max; int maxX; int i; int temp; int tempX; tempX = 0; temp = 1; max = 0; maxX = 0; for (i = 1; i max){ max = temp; maxX = tempX; } temp = 1; tempX = i; }... 阅读全文
posted @ 2014-03-18 14:21 yutoulck 阅读(133) 评论(0) 推荐(0) 编辑
摘要: #include #include int delX(int num[], int n, int x){ int i, j; i = 0; j = 0; for (i = 0; i < n; i++){ if (num[i] != x){ num[j] = num[i]; j++; } } return j;}print(int num[], int n){ int i; for (i = 0; i < n; i++){ printf("%d ", num[i]... 阅读全文
posted @ 2014-03-18 14:11 yutoulck 阅读(211) 评论(0) 推荐(0) 编辑
摘要: #include #include typedef struct Node{ int content; struct Node* next;}LNode;init(LNode** head){ *head = (LNode*)malloc(sizeof(LNode)); (*head)->content = 0; (*head)->next = NULL;}insert(LNode* head, int num){ LNode* newNode = (LNode*)malloc(sizeof(LNode)); newNode->content = nu... 阅读全文
posted @ 2014-03-18 12:42 yutoulck 阅读(596) 评论(0) 推荐(0) 编辑
摘要: package com.example.app;import android.os.HandlerThread;import android.os.Message;import android.support.v7.app.ActionBarActivity;import android.support.v7.app.ActionBar;import android.support.v4.app.Fragment;import android.os.Bundle;import android.util.Log;import android.view.LayoutInflater;import 阅读全文
posted @ 2014-03-18 00:08 yutoulck 阅读(234) 评论(0) 推荐(0) 编辑