2019年3月25日
902. Numbers At Most N Given Digit Set
摘要： We have a sorted set of digits D, a non-empty subset of {'1','2','3','4','5','6','7','8','9'}. (Note that '0' is not included.) Now, we write numbers 阅读全文
posted @ 2019-03-25 10:21 Veritas_des_Liberty 阅读(242) 评论(0) 推荐(0)
898. Bitwise ORs of Subarrays
摘要： We have an array A of non-negative integers. For every (contiguous) subarray B = [A[i], A[i+1], ..., A[j]] (with i <= j), we take the bitwise OR of al 阅读全文
posted @ 2019-03-25 09:19 Veritas_des_Liberty 阅读(279) 评论(0) 推荐(0)