461. Hamming Distance

class Solution(object):
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        return bin(x^y).count('1')

这也不是我做出来的…… 想了二十分钟写了各种循环然而放弃了。。果然很简单，异或相同为0相异为1居然tmd半天没想出来。。。


评论

发表评论

此博客中的热门博文

232. Implement Queue using Stacks

MA: class MyQueue {     Stack<Integer> simQ=new Stack<Integer>();     Stack<Integer> buffer=new Stack<Integer>();     /** Initialize your data structure here. */     public MyQueue() {     }         /** Push element x to the back of queue. */     public void push(int x) {         simQ.push(x);     }         /** Removes the element from in front of queue and returns that element. */     public int pop() {         while(!simQ.empty()){             buffer.push(simQ.pop());         }         int temp=buffer.pop();         while(!buffer.empty()){             simQ.push(buffer.pop());         }         return temp;     } ...
阅读全文

496. Next Greater Element I

MA: class Solution {     public int[] nextGreaterElement(int[] nums1, int[] nums2) {         int[] nums3=new int[nums1.length];         for(int i=0;i<nums1.length;i++){             int max=-1;             nums3[i]=max;             int target=nums1[i];             boolean findTarget=false;             for(int j=0;j<nums2.length;j++){                 if(nums2[j]==nums1[i] && findTarget==false){                     findTarget=true;                     continue;                 }                 if(nums2[j]>target&&findTarget==true){ ...
阅读全文

20. Valid Parentheses

OA: class Solution { public boolean isValid (String s) { char [] stack = new char [s.length()]; int head = 0 ; for ( char c : s.toCharArray()) { if (c == '(' ) { stack[head++] = c; } else if (c == '[' ) { stack[head++] = c; } else if (c == '{' ) { stack[head++] = c; } else if (c == ')' ) { if (head == 0 ) return false ; if (stack[--head] != '(' ) return false ; } else if (c == ']' ) { if (head == 0 ) return false ; if (stack[--head] != '[' ) return false ; } else if (c == '}' ) { if (head == 0 ) return false ; if (stack[--head] != '{' ) return false ; } } return head == 0 ; } } OA比MA快一倍。 String有个toCharArray()...
阅读全文