一个数组中 连续的最大和

Author: wb-hjk570755

src/com/blankj/myself/AddTwoNumbers.java

@@ -0,0 +1,47 @@
+package com.blankj.myself;
+
+import com.blankj.myself.HasCycle_fast_slow_point.ListNode;
+
+/**
+ * Description:
+ * Copyright: Copyright (c) 2012
+ * Company: keruyun Technology(Beijing) Chengdu Co. Ltd.
+ *
+ * @author huangjk
+ * @version 1.0 2020/10/3
+ */
+public class AddTwoNumbers {
+
+    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
+        ListNode res = new ListNode(0);
+        ListNode curr = res;
+        int x,y,unit,carry=0;
+        while (l1!=null||l2!=null){
+            x = (l1==null?0:l1.val);
+            y = (l2==null?0:l2.val);
+
+
+            unit = (x + y + carry)%10 ;
+
+            curr.next = new ListNode(unit);
+            carry = (x + y + carry)/10;
+
+            if(l1!=null){
+                l1=l1.next;
+            }
+
+            if(l2!=null){
+                l2=l2.next;
+            }
+
+            curr = curr.next;
+
+        }
+
+        if(carry!=0){
+            curr.next = new ListNode(carry);
+        }
+
+        return res.next;
+    }
+}

src/com/blankj/myself/CountAndSay.java

@@ -0,0 +1,30 @@
+package com.blankj.myself;
+
+/**
+ * Description:
+ * Copyright: Copyright (c) 2012
+ * Company: keruyun Technology(Beijing) Chengdu Co. Ltd.
+ *
+ * @author huangjk
+ * @version 1.0 2020/10/3
+ */
+public class CountAndSay {
+    public String countAndSay(int n) {
+        StringBuilder res = new StringBuilder("1");
+        for(int i=1;i<=n;i++){
+            char[] tempArr = res.toString().toCharArray();
+            char temp;
+            int k=0;
+            res = new StringBuilder();
+            for (int j=0;j<tempArr.length;j++){
+                if(tempArr[j]==tempArr[j+1]){
+                    k = k+1;
+                }else {
+                    res.append(k).append(tempArr[j]);
+                    k = 0;
+                }
+            }
+        }
+        return res.toString();
+    }
+}