第一题 简单题,就不多写了
class Solution:def findKOr(self, nums: List[int], k: int) -> int:ans [0] * 31for n in nums:for i in range(31):if 2**i & n 2**i:ans[i] 1return sum([2**i if ans[i] > k else 0 for i in range(31)])第二题 0 至少…
功能代码:
FORM frm_user_command USING r_ucomm LIKE sy-ucommrs_selfield TYPE slis_selfield." BREAK ABAP05.CASE r_ucomm.WHEN &IC1.PERFORM frm_show_detail USING rs_selfield.WHEN . "点击 detail 按钮时,显示供应商的采购订单列…