Merge pull request #26 from luzhzhsoft/master

fixed 201 problem  -1 can not shift bug

notes/LeetCode第201号问题：数字范围按位与.md

@@ -48,7 +48,7 @@
 class Solution {
 public:
     int rangeBitwiseAnd(int m, int n) {
-        int d = INT_MAX;
+        unsigned int d = INT_MAX;
         while ((m & d) != (n & d)) {
             d <<= 1;
         }

notes/LeetCode第268号问题：缺失数字.md

@@ -40,8 +40,9 @@
 class Solution {
     public int missingNumber(int[] nums) {
         int res = 0;
+        int i = 0;
         //注意数组越界情况
-        for (int i = 0; i < nums.length;i++){
+        for (; i < nums.length;i++){
             // i 表示完整数组中的数字，与原数组中的数字 nums[i] 进行异或，再与保存的结果异或
             res = res^i^nums[i];
         }