关于开发的APP微信分享报错

Question

自己做了一个苹果的APP，做了一个分享功能。自己分享就是报错，别人分享没有问题，报错出错如下,也找了些办法，未解决！求高人指点！

Answer 1

#include
#include "stdlib.h"
#include "malloc.h"
#include "iostream"
#include "string.h"
#include "fstream"
#define maxsymbs 100 //最多有30个叶结点
#define maxbits 30 //每个叶结点编码最多30位
#define maxnode 199 //允许有2*n-1个结点
#define MAXSIZE 100
typedef struct
{
int weight;
int flag; //判断一个节点是否加入哈夫曼树中的标志，0为未加入，1为加入
int parent;
int lchild;
int rchild;
}huffnode;
typedef struct
{
int bits[maxbits];
int start;
}huffcode;
typedef int Status;
typedef struct
{
int key;
int huffN;
}RedType;
typedef struct
{
RedType r[MAXSIZE+1];
int length;
}HeapType;
void HeapAdjust(HeapType &H,int s,int m)
{
RedType rc;
int j;
rc=H.r[s];
for(j=2*s;j<=m;j*=2)
{
if(j if(rc.key>=H.r[j].key) break;
H.r[s]=H.r[j];
s=j;
}
H.r[s]=rc;
}
void HeapSort(HeapType &H)
{
RedType t;
int i;
for(i=H.length/2;i>0;i--) HeapAdjust(H,i,H.length);
for(i=H.length;i>1;i--)
{
t=H.r[1];H.r[1]=H.r[i];H.r[i]=t;
HeapAdjust(H,1,i-1);
}
}
void wenjian(int b[26])
{
FILE *fp;
int i;
char c[2000],ch;
if((fp=fopen("ab.txt","r"))==NULL)
{
printf("Can not open the file\n");
exit(0);
}
printf("\nfile A:\n");
for(i=0;(ch=fgetc(fp))!=EOF;i++)
{
c[i]=ch;
putchar(c[i]);
if(ch>='A'&&ch<='Z') b[ch-'A']++;
if(ch>='a'&&ch<='z') b[ch-'a']++;
}
fclose(fp);

} 

int main()
{
huffnode huff_node[maxnode];
huffcode huff_code[maxsymbs],cd;
HeapType H;
int b[26];
int i,j,x1,x2,n,c,p,w;
n=26;
for(i=0;i<2*n-1;i++)
{
huff_node[i].weight=0;
huff_node[i].parent=-1;
huff_node[i].flag=0;
huff_node[i].lchild=0;
huff_node[i].rchild=0;
}
for(i=0;i<n;i++)
{
b[i]=0;
}
wenjian(b);
for(i=0;i<n;i++)
{
huff_node[i].weight=b[i];
}
for(i=0;i<n-1;i++)//构造哈夫曼树
{
H.length=0;
w=1;
for(j=0;j<n+i;j++)
{
if(huff_node[j].flag==0)
{
H.r[w].key=huff_node[j].weight;
H.r[w].huffN=j;
H.length++;w++;
}
}
HeapSort(H);
x1=H.r[1].huffN;
x2=H.r[2].huffN;

huff_node[x1].parent=n+i;
huff_node[x2].parent=n+i;
huff_node[x1].flag=1;
huff_node[x2].flag=1;
huff_node[n+i].weight=huff_node[x1].weight+huff_node[x2].weight;
huff_node[n+i].lchild=x1;
huff_node[n+i].rchild=x2;
}
for(i=0;i<n;i++)//求字符的哈夫曼编码
{
cd.start=n;
c=i;
p=huff_node[c].parent;
while(p!=-1)
{
if(huff_node[p].lchild==c) cd.bits[cd.start]=0;
else cd.bits[cd.start]=1;
cd.start=cd.start-1;
c=p;
p=huff_node[p].parent;
}
for(j=cd.start+1;j<=n;j++) huff_code[i].bits[j]=cd.bits[j];
huff_code[i].start=cd.start;
}
for(i=0;i<n;i++)//输出字符的哈夫曼编码
{

      printf("%c出现的次数=%d  它的编码为",'a'+i,huff_node[i].weight);
      for(j=huff_code[i].start+1;j<=n;j++)
          printf("%d",huff_code[i].bits[j]);
      printf("\n");
  }
  return 0;

}