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[];

        for(int i = ; i < len; i++){

            a ^= nums[i];

            // cout<<a<<endl;

        }

        return a;

    }

};

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() < )   return ;

        vector<int> dp(A.size(), );

        int res = ;

        for (int i = ; i < A.size(); i ++) {

            if (A[i] - A[i - ] == A[i - ] - A[i - ])

                dp[i] = dp[i - ] + ;

            res += dp[i];

        }

        return res;

    }

};