zoukankan      html  css  js  c++  java
  • Epic OA Day2 2014/11/7

    1. Count and Say

    The count-and-say sequence is the sequence of integers beginning as follows:
    1, 11, 21, 1211, 111221, ...

    1 is read off as "one 1" or 11.
    11 is read off as "two 1s" or 21.
    21 is read off as "one 2, then one 1" or 1211.

    Given an integer n, generate the nth sequence.

    Note: The sequence of integers will be represented as a string.

    2. Maximum Subarray

    Integer.MIN_VALUE

    sum = sum+array[i];

    max = Math.max(sum, max);

    if(sum+array[i]<0) sum = 0;

  • 相关阅读:
    栈和队列
    链表
    map
    二叉平衡树旋转
    二叉排序树详情
    红黑树详情
    查并集
    动态规划
    位操作
    字典树
  • 原文地址:https://www.cnblogs.com/superbo/p/4082643.html
Copyright © 2011-2022 走看看