70,023
社区成员




- void fun(char str[])
- {
- printf("After transform:%d\n", sizeof(str));
- }
- int main(){
- char strs[]="abcdefg";
- printf("Before transform:%d\n",sizeof(strs));
- fun(strs);
- return 0;
- }
- typedef struct Link_Node{
- int Elem;
- struct Link_Node *next;
- }LinkNode,*PLinkList;
- void CreateList(LinkNode *header)
- {
- int i=0;
- header = (LinkNode *)malloc(sizeof(LinkNode));
- header->Elem = 10;
- header->next = NULL;
- }
- int main()
- {
- PLinkList head=NULL;
- CreateList(head);
- if(head!=NULL)
- printf("%d\n",head->Elem);
- free(head);
- return 0;
- }
- void Trans(int* Arr,int nLength)
- {
- for(int i=0;i<nLength;i++)
- Arr[i] += i+20;
- }
- int main()
- {
- int nArr[5]={0};
- int i;
- printf("Before:\n");
- for(i=0;i<5;i++)
- printf("%d ",nArr[i]);
- Trans(nArr,5);
- printf("\nAfter\n");
- for(i=0;i<5;i++)
- printf("%d ",nArr[i]);
- return 0;
- }
- void CreateList(LinkNode **header)
- {
- int i=0;
- (*header) = (LinkNode *)malloc(sizeof(LinkNode));
- (*header)->Elem = 10;
- (*header)->next = NULL;
- }
- int main()
- {
- PLinkList head=NULL;
- CreateList(&head);
- if(head!=NULL)
- printf("%d\n",head->Elem);
- free(head);
- return 0;
- }
- typedef int (*func)(char a[],int nLength);
- int total(char a[],int nLength)
- {
- int nTotal = 0;
- for(int i=0;i<nLength;++i)
- nTotal += a[i];
- return nTotal;
- }
- int main()
- {
- char a[]="abcde";
- int nLength = strlen(a);
- func fp;
- fp = total;
- printf("%d\n",fp(a,nLength));
- return 0;
- }
#include<stdio.h>