zoukankan      html  css  js  c++  java
  • 2017/11/22 Leetcode 日记

    2017/11/22 Leetcode 日记

    136. Single Number

    Given an array of integers, every element appears twice except for one. Find that single one.

    class Solution {
    public:
        int singleNumber(vector<int>& nums) {
            int len = nums.size();
            int a = nums[0];
            for(int i = 1; i < len; i++){
                a ^= nums[i];
                // cout<<a<<endl;
            }
            return a;
        }
    };
    C++

    413. Arithmetic Slices

    A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

    For example, these are arithmetic sequence:

    1, 3, 5, 7, 9
    7, 7, 7, 7
    3, -1, -5, -9

    The following sequence is not arithmetic.

    1, 1, 2, 5, 7

    A zero-indexed array A consisting of N numbers is given. A slice of that array is any pair of integers (P, Q) such that 0 <= P < Q < N.

    A slice (P, Q) of array A is called arithmetic if the sequence:
    A[P], A[p + 1], ..., A[Q - 1], A[Q] is arithmetic. In particular, this means that P + 1 < Q.

    The function should return the number of arithmetic slices in the array A.

    class Solution {    
        // 2nd round        date: 2016-10-15        location: Vista Del Lago III Apartement
    public:
        int numberOfArithmeticSlices(vector<int>& A) {
            if (A.size() < 3)   return 0;
            vector<int> dp(A.size(), 0);
            int res = 0;
            for (int i = 2; i < A.size(); i ++) {
                if (A[i] - A[i - 1] == A[i - 1] - A[i - 2])
                    dp[i] = dp[i - 1] + 1;
                res += dp[i];
            }
            return res;
        }
    };
    c++
  • 相关阅读:
    npm
    React
    php区分new static 和new self
    tiny java web server
    算法可视化
    在线markdown编辑器
    JAVA
    linux find命令
    自定义windows新建菜单
    floyd算法
  • 原文地址:https://www.cnblogs.com/yoyo-sincerely/p/7877931.html
Copyright © 2011-2022 走看看