Merge pull request gzc426#300 from 018429/master

gzc426 · web-flow · commit d762365ba470 · 2018-12-04T17:22:53.000+08:00
018429.md
diff --git a/018429.c b/018429.c
@@ -0,0 +1,18 @@
+int firstUniqChar(char* s) {
+    int ascii[256]={0};
+    int i=0,len;
+    while(s[i]!='\0')
+    {
+        i++;
+    }
+    len=i;
+    for(i=0;i<len;i++)
+    {
+       ascii[s[i]]++;
+    }
+    i=0;
+    while(ascii[s[i]]!=1&&i<len) i++;
+    if(i==len)
+       return -1;
+    return i;
+}
diff --git a/2018.11.28-leetcode151/018429.md b/2018.11.28-leetcode151/018429.md
@@ -0,0 +1,48 @@
+int top=0; 
+void push(char c,char* stack) 
+{
+    stack[top++]=c;
+}
+char pop(char* stack) 
+{
+    return stack[--top];//写入s1 
+}
+void reverseWords(char *s) {
+    int i=0,j=0,flag=0;
+    while(s[i]!='\0') i++;
+    char* stack = (char*)malloc(i);
+    char* s1 = (char*)malloc(i+1);
+    i--;
+    while(i>=0)
+    {
+        if(s[i]==' ')
+        {
+            while(top!=0)//如果栈不为空
+            {
+                flag=1;
+                s1[j++]=pop(stack);
+            }
+            if(flag==1)
+            {
+         	  s1[j++]=' '; 
+         	  flag=0;//重置flag 
+			}
+            i--;
+        }
+        else
+        {
+            push(s[i--],stack);
+        }
+    }
+    if(s[++i]!=' ')
+    {
+    	while(top!=0)//如果栈不为空
+                s1[j++]=pop(stack);
+            s[j]=' ';
+	}
+	else
+		j--;
+	s1[j]='\0';
+	s = strcpy(s,s1);
+	free(s1); 
+}
