zoukankan      html  css  js  c++  java
  • 1318. Minimum Flips to Make a OR b Equal to c

    package LeetCode_1318
    
    /**
     * 1318. Minimum Flips to Make a OR b Equal to c
     * https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/description/
     *
     * Given 3 positives numbers a, b and c.
     * Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation).
    Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation.
    
    Example 1:
    Input: a = 2, b = 6, c = 5
    Output: 3
    Explanation: After flips a = 1 , b = 4 , c = 5 such that (a OR b == c)
     * */
    class Solution {
        fun minFlips(a: Int, b: Int, c: Int): Int {
            var count = 0
            var a_ = a
            var b_ = b
            var c_ = c
            while (a_ > 0 || b_ > 0 || c_ > 0) {
                //get the lowest bit
                val a0 = a_ and 1// a_ and 1 ==> a_ % 2
                val b0 = b_ and 1
                val c0 = c_ and 1
                //if current bit of c is 1 and a,b if 0, need flip one time
                if (c0 == 1) {
                    if (a0 == 0 && b0 == 0) {
                        count++
                    }
                } else {
                    //if current bit of c is 0:
                    //if current bit of a or b is 1, need flip one time,
                    //if current bit of a and b is 1, need flip two times,
                    count += a0 + b0
                }
                a_ = a_ shr 1
                b_ = b_ shr 1
                c_ = c_ shr 1
            }
            return count
        }
    }
  • 相关阅读:
    通过wifi上网,桥接模式下virtualBox虚拟机无法连上网的解决办法
    Djangio笔记
    nginx hello模块代码
    nginx 访问第三方服务(1)
    ngxin error日志
    lvs 负载均衡 NAT模式
    nginx location的命中过程
    linux epoll总结
    【转】操作系统 gdt ldt
    linux文件系统
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/13358135.html
Copyright © 2011-2022 走看看