iOS Swift import Foundation /** m行, n列 10,10 0,0,0,0,0,0,0,0,0,0 0,0,0,1,1,0,1,0,0,0 0,1,0,0,0,0,0,1,0,1 1,0,0,0,0,0,0,0,1,1 0,0,0,1,1,1,0,0,0,1 0,0,0,0,0,0,1,0,1,1 0,1,1,0,0,0,0,0,0,0 0,0,0,1,0,1,0,0,0,0 0,0,1,0,0,1,0,0,0,0 0,1,0,0,0,0,0,0,0,0 6,8 */ class Node { let value: Int var check: Bool = false init(_ value: Int) { self.value = value } } let first = readLine()!.split(separator: ",") let (m, n) = (Int(first[0])!, Int(first[1])!) var teamCount = 0 var count = 0 var maxCount = 0 var dict: [String: Node] = [:]; for row in 0..<m { let line = readLine()!.split(separator: ",").map{ Int($0) }.compactMap { $0 } for column in 0..<n { let location = "\(row)\(column)" dict[location] = Node(line[column]) } } func traverse(node: Node, row: Int, column: Int) { count += 1 node.check = true if column != 0, row != 0, let topleft = dict["\(row - 1)\(column - 1)"], topleft.value == 1, !topleft.check { traverse(node: topleft, row: row - 1, column: column - 1) } if row != 0, let top = dict["\(row - 1)\(column)"], top.value == 1, !top.check { traverse(node: top, row: row - 1, column: column) } if row != 0, column != n - 1, let topright = dict["\(row - 1)\(column + 1)"], topright.value == 1, !topright.check { traverse(node: topright, row: row - 1, column: column + 1) } if column != 0, let left = dict["\(row)\(column - 1)"], left.value == 1, !left.check { traverse(node: left, row: row, column: column - 1) } if column != n - 1, let right = dict["\(row)\(column + 1)"], right.value == 1, !right.check { traverse(node: right, row: row, column: column + 1) } if row != m - 1, column != 0, let buttomleft = dict["\(row + 1)\(column - 1)"], buttomleft.value == 1, !buttomleft.check { traverse(node: buttomleft, row: row + 1, column: column - 1) } if row != m - 1, let buttom = dict["\(row + 1)\(column)"], buttom.value == 1, !buttom.check { traverse(node: buttom, row: row + 1, column: column) } if row != m - 1, column != 0, let buttomright = dict["\(row + 1)\(column + 1)"], buttomright.value == 1, !buttomright.check { traverse(node: buttomright, row: row + 1, column: column + 1) } } for row in 0..<m { for column in 0..<n { let location = "\(row)\(column)" guard let node = dict[location], node.value == 1, !node.check else { continue } teamCount += 1 maxCount = count > maxCount ? count : maxCount count = 0 traverse(node: node, row: row, column: column) } } maxCount = count > maxCount ? count : maxCount print(teamCount, maxCount)
点赞 评论

相关推荐

咦哟,从去年八月份开始长跑,两处实习转正都失败了,风雨飘摇,终于拿到offer了更新一下面试记录:秋招:多部门反复面试然后挂掉然后复活,具体问了啥已经忘了,只是被反复煎炸,直至焦香😋春招:base北京抖音hr打来电话说再次复活,准备面试,gogogo北京抖音一面:六道笔试题:1.promise顺序2.定义域问题3.flat展开4.并发请求5.岛屿数量算法(力扣)深度,广度都写6.忘记了,好像也是算法,难度中等其他问题多是框架底层设计,实习项目重难点~~~秒过😇北京抖音二面:三道笔试题:(为什么只有三道是因为第三道没做出来,卡住了)1.中等难度算法(忘记啥题了,应该是个数组的)2.认识js的继承本质(手写继承模式,深入js的面相对象开发)3.手写vue的响应式(卡在了watch,导致挂掉)---后知后觉是我的注册副作用函数写得有问题,有点紧张了其他题目多是项目拷打,项目亮点,对实习项目的贡献~~~第二天,挂,but立马复活转战深圳客服当天约面深圳客服一面:六道笔试题,由于面过太多次字节,面试官叫我直接写,不用讲,快些写完😋,具体都是些继承,深拷贝(注意对数组对象分开处理,深层次对象,循环引用),加中等难度算法题~~~秒过深圳客服二面:口诉八股大战:大概囊括网络,浏览器渲染原理,动画优化,时间循环,任务队列等等(你能想到的简单八股通通拉出来鞭尸😋)算法题:笔试题6道:1:找出数组内重复的数,arr[0]-arr[n]内的数大小为[1-n],例如[1,2,2,3,3]返回[2,3],要求o(n),且不使用任何额外空间(做到了o(n),空间方面欠佳,给面试官说进入下一题,做不来了)2:原滋原味的继承(所以继承真滴很重要)3:力扣股票购买时机难度中等其他滴也忘记了,因为拿到offer后鼠鼠一下子就落地了,脑子自动过滤掉可能会攻击鼠鼠的记忆😷~~~秒过深圳客服三面:项目大战参与战斗的人员有:成员1:表单封装及其底层原理,使用成本的优化,声明式表单成员2:公司内部库生命周期管理成员3:第三方库和内部库冲突如何源码断点调试并打补丁解决成员4:埋点的艺术成员5:线上项目捷报频传如何查出内鬼成员6:大文件分片的风流趣事成员7:设计模式对对碰成员8:我构建hooks应对经理的新增的小需求的故事可能项目回答的比较流利,笔试题3道,都很简单,相信大家应该都可以手拿把掐😇~~~过过过无hr面后续煎熬等待几天直接hr打电话发offer了,希望大家也可以拿到自己心仪的offer
法力无边年:牛哇,你真是准备得充分,我对你没有嫉妒,都是实打实付出
查看19道真题和解析
点赞 评论 收藏
分享
程序员小假:人才
点赞 评论 收藏
分享
牛客网
牛客企业服务