Python to java converter

Convert code python to java

def BitmapHoles(strArr):
    bitmap = {}
    for i in range(len(strArr)):
        for j in range(len(strArr[i])):
            bitmap[(i,j)] = int(strArr[i][j])
    
    hole_count = 0
    hole = set()
    checked = set()
    flag = True
    
    for i in range(len(strArr)):
        for j in range(len(strArr[i])):
            stack = [(i,j)]
            while stack:
                coords = stack.pop()
                if coords not in checked:
                    checked.add(coords)
                    if bitmap[coords] == 0 and coords not in hole:
                        hole.add(coords)
                        if flag == True:
                            hole_count += 1
                            flag = False
                        if coords[0] - 1 >= 0 and (coords[0]-1,coords[1]) not in checked:
                            stack.append((coords[0]-1,coords[1]))
                        if coords[0] + 1 < len(strArr) and (coords[0]+1,coords[1]) not in checked:
                            stack.append((coords[0]+1,coords[1]))
                        if coords[1] - 1 >= 0 and (coords[0],coords[1]-1) not in checked:
                            stack.append((coords[0],coords[1]-1))
                        if coords[1] + 1 < len(strArr[coords[0]]) and (coords[0],coords[1]+1) not in checked:
                            stack.append((coords[0],coords[1]+1))
            flag = True
            
    return hole_count

Source: grepper.com

Python to java converter

import sys
import math


width = int(input())
height = int(input())
players = int(input())

class Player:
    def __init__(self, x, y):
        self.x = x
        self.y = y

DIR = {'UP' : 'C', 'RIGHT' : 'A', 'DOWN' : 'D', 'LEFT' : 'E', 'STAY' : 'B'}

grid = [['?' for x in range(width)] for y in range(height)]
enemies = [Player(-1,-1) for e in range(players-1)]
player = Player(-1,-1)

def enemyAtPos(x, y):
    for e in enemies:
        if x == e.x and y == e.y:
            return True
    return False
def getPossibleMoves(x, y):
    possibleMoves = []
    if grid[(y-1)%height][x] != '#':
        if not enemyAtPos(x, y-1) and not enemyAtPos(x, y-2) and not enemyAtPos(x-1, y-1) and not enemyAtPos(x+1, y-1):
            possibleMoves.append([x, (y-1)%height])
    if grid[y][(x+1)%width] != '#':
        if not enemyAtPos(x+1, y) and not enemyAtPos(x+2, y) and not enemyAtPos(x+1, y-1) and not enemyAtPos(x+1, y+1):
            possibleMoves.append([(x+1)%width, y])
    if grid[(y+1)%height][x] != '#':
        if not enemyAtPos(x, y+1) and not enemyAtPos(x, y+2) and not enemyAtPos(x-1, y+1) and not enemyAtPos(x+1, y+1):
            possibleMoves.append([x, (y+1)%height])
    if grid[y][(x-1)%width] != '#':
        if not enemyAtPos(x-1, y) and not enemyAtPos(x-2, y) and not enemyAtPos(x-1, y-1) and not enemyAtPos(x-1, y+1):
            possibleMoves.append([(x-1)%width, y])

    return possibleMoves

Source: grepper.com

Python to java converter

def getUmbrellas(requirement, sizes):
    for i in sizes:
        if i > requirement:
            pass
        else:
            q = requirement / i
            r = requirement % i
            if r == 0:
                return q
            if r in sizes:
                return q + 1
        return -1

Source: grepper.com

Python to java converter

array=list(map(int,input().split(",")))
array=sorted(array)
j=[]
j.append(array[0])
j.append(array[1])
for i in range(2,len(array)):
    if j[i-1]+j[i-2] in array:
        j.append(j[i-1]+j[i-2])
    else:
        break
print(j)

Source: grepper.com

Python to java converter software

#include <bits/stdc++.h>
using namespace std;
 
int main()
{
  int m,ans=INT_MAX,I=-1,J=-1;
  cin>>m;
  vector<vector<int>> mat(m,vector<int>());
  cin.ignore();
  for(int i=0;i<m;i++)
  {
    string s;
    getline(cin,s);
    istringstream ss(s);
    while(ss)
    {
      string w;
      ss>>w;
      if(w=="") break;
      mat[i].push_back(stoi(w));
    }
  }
  int n=mat[0].size();
  vector<vector<int>> Ans1(m,vector<int>(n,1));
  vector<vector<int>> Ans2(m,vector<int>(n,1));
  vector<vector<int>> Ans3(m,vector<int>(n,1));
  vector<vector<int>> Ans4(m,vector<int>(n,1));
 
  for(int i=0;i<m-1;i++)
  for(int j=0;j<mat[i].size();j++)
  if(mat[i][j]==mat[i+1][j])
    Ans1[i+1][j]=Ans1[i][j]+1;
  
  for(int i=0;i<m;i++)
  for(int j=0;j<mat[i].size() -1;j++)
  if(mat[i][j]==mat[i][j+1])
    Ans2[i][j+1]=Ans2[i][j]+1;
  
  for(int i=0;i<m-1;i++)
  for(int j=0;j<mat[i].size()-1;j++)
  if(mat[i][j]==mat[i+1][j+1])
    Ans3[i+1][j+1]=Ans3[i][j]+1;
 
  for(int i=0;i<m-1;i++)
  for(int j=1;j<mat[i].size();j++)
  if(mat[i][j]==mat[i+1][j-1])
    Ans4[i+1][j-1]=Ans4[i][j]+1;
  
  for(int i=0;i<m;i++)
  for(int j=0;j<mat[i].size();j++)
  {
    if(Ans1[i][j]>=4 && ans>mat[i][j])
    {ans=mat[i][j];I=i;J=j;}
    if(Ans2[i][j]>=4 && ans>mat[i][j])
    {ans=mat[i][j];I=i;J=j;}
    if(Ans3[i][j]>=4 && ans>mat[i][j])
    {ans=mat[i][j];I=i;J=j;}
    if(Ans3[i][j]>=4 && ans>mat[i][j])
    {ans=mat[i][j];I=i;J=j;}
  }
  if(I==-1)cout<<-1;
  else cout<<ans<<endl;
  
}

Source: grepper.com

Convert code python to java

s=input()
l=[]
s1='aeiou'
sum1=0
def snm(sum1):
    t=0
    while(sum1>0 or t>9):
        if(sum1==0):
            sum1=t
            t=0
        t=t+sum1%10
        sum1=sum1//10
    return t
    
for i in range(len(s)):
    if s[i] in s1:
        l.append(i)
for j in range(len(l)):
    k=l[j]*5
    sum1=0
    for h in range(1,k+1,2):
        sum1=sum1+h
    print(snm(sum1))

Source: grepper.com

Convert python to java

import check50
import check50_java

@check50.check()
def book_exists():
    """Book.java exists."""
    check50.exists("Book.java")

@check50.check(book_exists)
def book_compiles():
    """Book.java compiles."""
    check50_java.compile("Book.java")

@check50.check()
def press_exists():
    """Press.java exists."""
    check50.exists("Press.java")

@check50.check(press_exists)
def press_compiles():
    """Press.java compiles."""
    check50_java.compile("Press.java")

@check50.check()
def vm_exists():
    """VendingMachine.java exists."""
    check50.exists("VendingMachine.java")

@check50.check(vm_exists)
def vm_compiles():
    """VendingMachine.java compiles."""
    check50_java.compile("VendingMachine.java")

Source: grepper.com

Convert code python to java

def BitmapHoles(strArr):
    bitmap = {}
    for i in range(len(strArr)):
        for j in range(len(strArr[i])):
            bitmap[(i,j)] = int(strArr[i][j])
    
    hole_count = 0
    hole = set()
    checked = set()
    flag = True
    
    for i in range(len(strArr)):
        for j in range(len(strArr[i])):
            stack = [(i,j)]
            while stack:
                coords = stack.pop()
                if coords not in checked:
                    checked.add(coords)
                    if bitmap[coords] == 0 and coords not in hole:
                        hole.add(coords)
                        if flag == True:
                            hole_count += 1
                            flag = False
                        if coords[0] - 1 >= 0 and (coords[0]-1,coords[1]) not in checked:
                            stack.append((coords[0]-1,coords[1]))
                        if coords[0] + 1 < len(strArr) and (coords[0]+1,coords[1]) not in checked:
                            stack.append((coords[0]+1,coords[1]))
                        if coords[1] - 1 >= 0 and (coords[0],coords[1]-1) not in checked:
                            stack.append((coords[0],coords[1]-1))
                        if coords[1] + 1 < len(strArr[coords[0]]) and (coords[0],coords[1]+1) not in checked:
                            stack.append((coords[0],coords[1]+1))
            flag = True
            
    return hole_count

Source: grepper.com

Convert python to java

s=input()
l=[]
s1='aeiou'
sum1=0
def snm(sum1):
    t=0
    while(sum1>0 or t>9):
        if(sum1==0):
            sum1=t
            t=0
        t=t+sum1%10
        sum1=sum1//10
    return t

Source: grepper.com

Code converter from java to python

intervies question

Source: grepper.com

Similar codes

0 vote206 views1 answer
Get the number of weeks between two dates
Java
0 vote234 views1 answer
Kotlin spinner default value
Java
1 vote248 views1 answer
Java radnom
Java
11 votes202 views2 answers
Java generics
Java
1 vote199 views1 answer
Java find substring between two strings
Java
0 vote193 views1 answer
Arrays vs collections
Java
0 vote211 views1 answer
Show all debug points intellij
Java
0 vote191 views1 answer
Retrieving parent element from child aWebelement selenium java
Java
3 votes191 views2 answers
Priority queue reverse order java
Java
0 vote261 views1 answer
How to do 4th root java
Java