[PYTHON] Let Code Day67 Starting from Zero "1486. XOR Operation in an Array"

Overview

It seems that coding tests are conducted overseas in interviews with engineers, and in many cases, the main thing is to implement specific functions and classes according to the theme.

Apparently, many engineers take measures on the site called LetCode.

It is a site that trains the algorithmic power that can withstand the coding test that is being done in the early story, and it is an inevitable path for those who want to build a career at an overseas tech company.

I wrote it in a big way, but I have no plans to have such an interview at the moment.

However, as an IT engineer, it would be better to have the same level of algorithm power as a person, so I would like to solve the problem irregularly and write down the method I thought at that time as a memo.

Leetcode

I'm solving it with Python3.

Leet Code Table of Contents Starting from Zero

Last time Leet Code Day 66 "438. Find All Anagrams in a String" starting from zero

Right now, I'm prioritizing the Medium of the Top 100 Liked Questions. I solved all Easy, so if you are interested, please go to the table of contents.

Twitter I'm doing it.

** Technical Blog Started! !! ** ** I think the technology will write about LetCode, Django, Nuxt, and so on. ** This is faster to update **, so please bookmark it!

problem

1486. XOR Operation in an Array

The problem is given the integer n and the integer start.

nums [i] = start + 2 * i (0-indexed) defines the array nums of n == nums.length.

Returns the bitwise XOR of all elements of nums.

solution

class Solution:
    def xorOperation(self, n: int, start: int) -> int:
        ans = 0
        for i in range(n):
            ans ^= start + 2 * i
        return ans
# Runtime: 24 ms, faster than 95.07% of Python3 online submissions for XOR Operation in an Array.
# Memory Usage: 13.9 MB, less than 100.00% of Python3 online submissions for XOR Operation in an Array.

class Solution:
    def xorOperation(self, n: int, start: int) -> int:
        i = ans = 0
        while i<n:
            val = start + 2*i
            ans ^= val
            i+=1
        return ans
# Runtime: 24 ms, faster than 95.07% of Python3 online submissions for XOR Operation in an Array.
# Memory Usage: 13.9 MB, less than 100.00% of Python3 online submissions for XOR Operation in an Array.

What I'm doing is the same in either case, and to be honest, the content was simple, but I got a quick answer, so I wrote an article.

To be honest, when I first saw it, it was mostly written in the commentary, so I took a lot of detours, but in the end I solved it.

This is a recommended problem for beginners who have never solved it to get an image!

So that's it for this time. Thank you for your hard work.