Merge pull request gzc426#6 from symkmk/symkmk-patch-3

symkmk · web-flow · commit c47e9dcb8495 · 2018-12-03T05:54:12.000-06:00
Create 妮可.md
diff --git a/2018.11.29-leetcode443/妮可.md b/2018.11.29-leetcode443/妮可.md
@@ -0,0 +1,60 @@
+```java
+package sy181203;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+
+public class leetcode_443压缩字符串
+{
+
+	public static void main(String[] args)
+	{
+		 char[] chars = {'a','b','b','b','c','c','b','b','b','b','b','b','b','b','b','b','b','b'};
+		  System.out.println(Arrays.toString(chars));
+		
+		  System.out.println(compress(chars));
+
+	}
+	
+	  public static int compress(char[] chars) 
+	  {
+		  if(chars.length==0)
+			  return 0;
+		  int m=0,i=0,j;
+		  while(i<chars.length)//外层循环控制总次数
+		  {
+			  j=i;
+			  chars[m++]=chars[i];
+			  int k=0;//统计重复字母数
+			  while(j<chars.length && chars[i]==chars[j])//内层循环判断是不是同一个字母
+			  {
+				  k++;
+				  j++;
+			  }
+			  StringBuilder sb=new StringBuilder();
+			  if(k!=1)//k=1不用再加数字
+			  {
+				  while(k!=0)//除来减小,到0出循环
+				  {
+					  System.out.println("k%10  "+(k%10));
+					  sb.append((char)(k%10+48));
+					  k/=10;
+				  }
+			  }
+			  System.out.println("sb ==="+sb.toString());
+			  sb.reverse();//
+			  System.out.println("sbre ==="+sb.toString());
+			  for(char c:sb.toString().toCharArray())
+
+			  {
+					  System.out.println("c="+c);
+					  chars[m++]=c;
+			  }
+			  i=j;//置位
+		  }
+		  System.out.println(Arrays.toString(chars));
+		  return m;
+	  }
+
+}
+```
